{"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/dimensionality-reduction/papers/ran/1","list_of":"/task/dimensionality-reduction","task":"Dimensionality Reduction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,100],"of":100,"counts":{"archive_papers_tagged":3304,"with_a_code_link":857,"where_syntology_ran_a_sample":100,"not_listed_spam_title":0,"listed":3304,"listed_where_code_ran":100,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":84,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":84,"listed_every_run_a_failure_of_syntologys_instrument":16,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/dimensionality-reduction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/dids-domain-impact-aware-data-sampling-for","slug":"dids-domain-impact-aware-data-sampling-for","title":"DIDS: Domain Impact-aware Data Sampling for Large Language Model Training","date":"2025-04-17","arxiv_id":"2504.13227","repositories_listed":0,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/dids-domain-impact-aware-data-sampling-for#ran","syntology_url":"https://syntology.ai/paper/2504.13227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.13227"}},"official":null}},{"url":"/paper/a-flag-decomposition-for-hierarchical","slug":"a-flag-decomposition-for-hierarchical","title":"A Flag Decomposition for Hierarchical Datasets","date":"2025-02-11","arxiv_id":"2502.07782","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/a-flag-decomposition-for-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2502.07782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07782"}},"official":{"repos":["nmank/FD"],"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/navigating-the-effect-of-parametrization-for","slug":"navigating-the-effect-of-parametrization-for","title":"Navigating the Effect of Parametrization for Dimensionality Reduction","date":"2024-11-24","arxiv_id":"2411.15894","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/navigating-the-effect-of-parametrization-for#ran","syntology_url":"https://syntology.ai/paper/2411.15894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15894"}},"official":{"repos":["hyhuang00/paramrepulsor"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/balanced-neural-odes-nonlinear-model-order","slug":"balanced-neural-odes-nonlinear-model-order","title":"Balanced Neural ODEs: nonlinear model order reduction and Koopman operator approximations","date":"2024-10-14","arxiv_id":"2410.10174","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/balanced-neural-odes-nonlinear-model-order#ran","syntology_url":"https://syntology.ai/paper/2410.10174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10174"}},"official":{"repos":["juliusaka/balanced-neural-odes"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/broadcast-product-shape-aligned-element-wise","slug":"broadcast-product-shape-aligned-element-wise","title":"Broadcast Product: Shape-aligned Element-wise Multiplication and Beyond","date":"2024-09-26","arxiv_id":"2409.17502","repositories_listed":0,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"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) · 6 unverified","sample_list":"/paper/broadcast-product-shape-aligned-element-wise#ran","syntology_url":"https://syntology.ai/paper/2409.17502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17502"}},"official":null}},{"url":"/paper/exploring-semantic-clustering-in-deep","slug":"exploring-semantic-clustering-in-deep","title":"Exploring Semantic Clustering in Deep Reinforcement Learning for Video Games","date":"2024-09-25","arxiv_id":"2409.17411","repositories_listed":0,"syntology":{"n":17,"n_ran":9,"n_constructed":6,"n_ran_checked":7,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/exploring-semantic-clustering-in-deep#ran","syntology_url":"https://syntology.ai/paper/2409.17411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17411"}},"official":null}},{"url":"/paper/distributional-principal-autoencoders","slug":"distributional-principal-autoencoders","title":"Distributional Principal Autoencoders","date":"2024-04-21","arxiv_id":"2404.13649","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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/distributional-principal-autoencoders#ran","syntology_url":"https://syntology.ai/paper/2404.13649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13649"}},"official":{"repos":["xwshen51/distributionalprincipalautoencoder"],"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/quiver-laplacians-and-feature-selection","slug":"quiver-laplacians-and-feature-selection","title":"Quiver Laplacians and Feature Selection","date":"2024-04-10","arxiv_id":"2404.06993","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/quiver-laplacians-and-feature-selection#ran","syntology_url":"https://syntology.ai/paper/2404.06993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06993"}},"official":{"repos":["osumray/harmonic_feature_selection"],"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/preventing-model-collapse-in-gaussian-process","slug":"preventing-model-collapse-in-gaussian-process","title":"Preventing Model Collapse in Gaussian Process Latent Variable Models","date":"2024-04-02","arxiv_id":"2404.01697","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":8,"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/preventing-model-collapse-in-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/2404.01697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01697"}},"official":{"repos":["zhidilin/advisedgplvm"],"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/once-for-both-single-stage-of-importance-and","slug":"once-for-both-single-stage-of-importance-and","title":"Once for Both: Single Stage of Importance and Sparsity Search for Vision Transformer Compression","date":"2024-03-23","arxiv_id":"2403.15835","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/once-for-both-single-stage-of-importance-and#ran","syntology_url":"https://syntology.ai/paper/2403.15835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15835"}},"official":{"repos":["hankye/once-for-both"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/light-curve-classification-with-distclassipy","slug":"light-curve-classification-with-distclassipy","title":"Light Curve Classification with DistClassiPy: a new distance-based classifier","date":"2024-03-18","arxiv_id":"2403.12120","repositories_listed":2,"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/light-curve-classification-with-distclassipy#ran","syntology_url":"https://syntology.ai/paper/2403.12120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12120"}},"official":{"repos":["sidchaini/distclassipy","sidchaini/lightcurvedistanceclassification"],"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/pqmass-probabilistic-assessment-of-the","slug":"pqmass-probabilistic-assessment-of-the","title":"PQMass: Probabilistic Assessment of the Quality of Generative Models using Probability Mass Estimation","date":"2024-02-06","arxiv_id":"2402.04355","repositories_listed":0,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pqmass-probabilistic-assessment-of-the#ran","syntology_url":"https://syntology.ai/paper/2402.04355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04355"}},"official":null}},{"url":"/paper/linear-recursive-feature-machines-provably","slug":"linear-recursive-feature-machines-provably","title":"Linear Recursive Feature Machines provably recover low-rank matrices","date":"2024-01-09","arxiv_id":"2401.04553","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":3,"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/linear-recursive-feature-machines-provably#ran","syntology_url":"https://syntology.ai/paper/2401.04553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04553"}},"official":{"repos":["aradha/lin-rfm"],"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/fun-with-flags-robust-principal-directions","slug":"fun-with-flags-robust-principal-directions","title":"Fun with Flags: Robust Principal Directions via Flag Manifolds","date":"2024-01-08","arxiv_id":"2401.04071","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/fun-with-flags-robust-principal-directions#ran","syntology_url":"https://syntology.ai/paper/2401.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04071"}},"official":{"repos":["nmank/funwithflags"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/speeding-up-astrochemical-reaction-networks","slug":"speeding-up-astrochemical-reaction-networks","title":"Speeding up astrochemical reaction networks with autoencoders and neural ODEs","date":"2023-12-10","arxiv_id":"2312.06015","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/speeding-up-astrochemical-reaction-networks#ran","syntology_url":"https://syntology.ai/paper/2312.06015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.06015"}},"official":{"repos":["immi000/chemicalneuralode"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/metric-space-magnitude-for-evaluating","slug":"metric-space-magnitude-for-evaluating","title":"Metric Space Magnitude for Evaluating the Diversity of Latent Representations","date":"2023-11-27","arxiv_id":"2311.16054","repositories_listed":2,"syntology":{"n":33,"n_ran":30,"n_constructed":0,"n_ran_checked":30,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":30,"n_pointer_only":10,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 0 violated, 30 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/metric-space-magnitude-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2311.16054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.16054"}},"official":{"repos":["aidos-lab/magnitude-diversity","aidos-lab/magnipy"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/bounds-on-representation-induced-confounding","slug":"bounds-on-representation-induced-confounding","title":"Bounds on Representation-Induced Confounding Bias for Treatment Effect Estimation","date":"2023-11-19","arxiv_id":"2311.11321","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bounds-on-representation-induced-confounding#ran","syntology_url":"https://syntology.ai/paper/2311.11321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.11321"}},"official":{"repos":["valentyn1997/ricb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/language-model-training-paradigms-for","slug":"language-model-training-paradigms-for","title":"Language Model Training Paradigms for Clinical Feature Embeddings","date":"2023-11-01","arxiv_id":"2311.00768","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/language-model-training-paradigms-for#ran","syntology_url":"https://syntology.ai/paper/2311.00768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00768"}},"official":{"repos":["yuroeth/icu_benchmarks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dq-lore-dual-queries-with-low-rank","slug":"dq-lore-dual-queries-with-low-rank","title":"DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning","date":"2023-10-04","arxiv_id":"2310.02954","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dq-lore-dual-queries-with-low-rank#ran","syntology_url":"https://syntology.ai/paper/2310.02954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02954"}},"official":{"repos":["ai4fun/dq-lore"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/a-3d-explainability-framework-to-uncover","slug":"a-3d-explainability-framework-to-uncover","title":"An explainable three dimension framework to uncover learning patterns: A unified look in variable sulci recognition","date":"2023-09-02","arxiv_id":"2309.00903","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/a-3d-explainability-framework-to-uncover#ran","syntology_url":"https://syntology.ai/paper/2309.00903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00903"}},"official":{"repos":["ece7048/3dsulci"],"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/multi-fidelity-reduced-order-surrogate","slug":"multi-fidelity-reduced-order-surrogate","title":"Multi-fidelity reduced-order surrogate modeling","date":"2023-09-01","arxiv_id":"2309.00325","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-fidelity-reduced-order-surrogate#ran","syntology_url":"https://syntology.ai/paper/2309.00325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00325"}},"official":{"repos":["contipaolo/multifidelity_pod"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dimensionality-reduction-for-improving-out-of","slug":"dimensionality-reduction-for-improving-out-of","title":"Dimensionality Reduction for Improving Out-of-Distribution Detection in Medical Image Segmentation","date":"2023-08-07","arxiv_id":"2308.03723","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/dimensionality-reduction-for-improving-out-of#ran","syntology_url":"https://syntology.ai/paper/2308.03723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03723"}},"official":{"repos":["mckellwoodland/dimen_reduce_mahal"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-computational-topology-based-spatiotemporal","slug":"a-computational-topology-based-spatiotemporal","title":"A Computational Topology-based Spatiotemporal Analysis Technique for Honeybee Aggregation","date":"2023-07-19","arxiv_id":"2307.09720","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-computational-topology-based-spatiotemporal#ran","syntology_url":"https://syntology.ai/paper/2307.09720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09720"}},"official":{"repos":["vrd1243/tda_bees"],"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/super-resolution-neural-operator","slug":"super-resolution-neural-operator","title":"Super-Resolution Neural Operator","date":"2023-03-05","arxiv_id":"2303.02584","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/super-resolution-neural-operator#ran","syntology_url":"https://syntology.ai/paper/2303.02584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.02584"}},"official":{"repos":["2y7c3/super-resolution-neural-operator"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-kernel-principal-component-analysis-for","slug":"deep-kernel-principal-component-analysis-for","title":"Deep Kernel Principal Component Analysis for Multi-level Feature Learning","date":"2023-02-22","arxiv_id":"2302.11220","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-kernel-principal-component-analysis-for#ran","syntology_url":"https://syntology.ai/paper/2302.11220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11220"}},"official":{"repos":["taralloc/deepkpca"],"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/pac-bayesian-generalization-bounds-for-1","slug":"pac-bayesian-generalization-bounds-for-1","title":"PAC-Bayesian Generalization Bounds for Adversarial Generative Models","date":"2023-02-17","arxiv_id":"2302.08942","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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pac-bayesian-generalization-bounds-for-1#ran","syntology_url":"https://syntology.ai/paper/2302.08942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08942"}},"official":{"repos":["diarra2339/pac-bayes-wgan"],"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/learning-3d-human-pose-estimation-from-dozens","slug":"learning-3d-human-pose-estimation-from-dozens","title":"Learning 3D Human Pose Estimation from Dozens of Datasets using a Geometry-Aware Autoencoder to Bridge Between Skeleton Formats","date":"2022-12-29","arxiv_id":"2212.14474","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/learning-3d-human-pose-estimation-from-dozens#ran","syntology_url":"https://syntology.ai/paper/2212.14474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14474"}},"official":null}},{"url":"/paper/quantifying-local-extrinsic-curvature-in","slug":"quantifying-local-extrinsic-curvature-in","title":"Quantifying Extrinsic Curvature in Neural Manifolds","date":"2022-12-20","arxiv_id":"2212.10414","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/quantifying-local-extrinsic-curvature-in#ran","syntology_url":"https://syntology.ai/paper/2212.10414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10414"}},"official":{"repos":["bioshape-lab/neuralgeom"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/transform-once-efficient-operator-learning-in","slug":"transform-once-efficient-operator-learning-in","title":"Transform Once: Efficient Operator Learning in Frequency Domain","date":"2022-11-26","arxiv_id":"2211.14453","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/transform-once-efficient-operator-learning-in#ran","syntology_url":"https://syntology.ai/paper/2211.14453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14453"}},"official":{"repos":["diffeqml/kairos"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalized-eigengame-with-extensions-to","slug":"a-generalized-eigengame-with-extensions-to","title":"A Generalized EigenGame with Extensions to Multiview Representation Learning","date":"2022-11-21","arxiv_id":"2211.11323","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/a-generalized-eigengame-with-extensions-to#ran","syntology_url":"https://syntology.ai/paper/2211.11323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11323"}},"official":null}},{"url":"/paper/ian-iterated-adaptive-neighborhoods-for","slug":"ian-iterated-adaptive-neighborhoods-for","title":"IAN: Iterated Adaptive Neighborhoods for manifold learning and dimensionality estimation","date":"2022-08-19","arxiv_id":"2208.09123","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/ian-iterated-adaptive-neighborhoods-for#ran","syntology_url":"https://syntology.ai/paper/2208.09123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.09123"}},"official":{"repos":["dyballa/ian"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-systemic-error-detection-methods","slug":"evaluating-systemic-error-detection-methods","title":"Towards a More Rigorous Science of Blindspot Discovery in Image Classification Models","date":"2022-07-08","arxiv_id":"2207.04104","repositories_listed":2,"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/evaluating-systemic-error-detection-methods#ran","syntology_url":"https://syntology.ai/paper/2207.04104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04104"}},"official":{"repos":["njohnson99/spotcheck"],"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/gidr-dun-gradient-dimensionality-reduction","slug":"gidr-dun-gradient-dimensionality-reduction","title":"GiDR-DUN; Gradient Dimensionality Reduction -- Differences and Unification","date":"2022-06-20","arxiv_id":"2206.09689","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/gidr-dun-gradient-dimensionality-reduction#ran","syntology_url":"https://syntology.ai/paper/2206.09689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09689"}},"official":{"repos":["andrew-draganov/gidr-dun"],"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/fiberwise-dimensionality-reduction-of","slug":"fiberwise-dimensionality-reduction-of","title":"FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles","date":"2022-06-13","arxiv_id":"2206.06513","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":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fiberwise-dimensionality-reduction-of#ran","syntology_url":"https://syntology.ai/paper/2206.06513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.06513"}},"official":{"repos":["LuisScoccola/fibered"],"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/minimizing-the-expected-posterior-entropy","slug":"minimizing-the-expected-posterior-entropy","title":"Unifying Summary Statistic Selection for Approximate Bayesian Computation","date":"2022-06-06","arxiv_id":"2206.02340","repositories_listed":1,"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/minimizing-the-expected-posterior-entropy#ran","syntology_url":"https://syntology.ai/paper/2206.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02340"}},"official":{"repos":["tillahoffmann/summaries"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/trainable-weight-averaging-for-fast","slug":"trainable-weight-averaging-for-fast","title":"Trainable Weight Averaging: A General Approach for Subspace Training","date":"2022-05-26","arxiv_id":"2205.13104","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/trainable-weight-averaging-for-fast#ran","syntology_url":"https://syntology.ai/paper/2205.13104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13104"}},"official":{"repos":["nblt/twa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/film-frequency-improved-legendre-memory-model","slug":"film-frequency-improved-legendre-memory-model","title":"FiLM: Frequency improved Legendre Memory Model for Long-term Time Series Forecasting","date":"2022-05-18","arxiv_id":"2205.08897","repositories_listed":3,"syntology":{"n":18,"n_ran":17,"n_constructed":2,"n_ran_checked":7,"n_instrument":10,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"17 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 10 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/film-frequency-improved-legendre-memory-model#ran","syntology_url":"https://syntology.ai/paper/2205.08897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08897"}},"official":{"repos":["WenjieDu/PyPOTS"],"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","named_in_paper"]}}},{"url":"/paper/dimension-reduction-for-efficient-dense","slug":"dimension-reduction-for-efficient-dense","title":"Dimension Reduction for Efficient Dense Retrieval via Conditional Autoencoder","date":"2022-05-06","arxiv_id":"2205.03284","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/dimension-reduction-for-efficient-dense#ran","syntology_url":"https://syntology.ai/paper/2205.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03284"}},"official":{"repos":["neuir/conae"],"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/hierarchical-nearest-neighbor-graph-embedding","slug":"hierarchical-nearest-neighbor-graph-embedding","title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","date":"2022-03-24","arxiv_id":"2203.12997","repositories_listed":1,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/hierarchical-nearest-neighbor-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2203.12997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12997"}},"official":{"repos":["koulakis/h-nne"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/grassmann-stein-variational-gradient-descent","slug":"grassmann-stein-variational-gradient-descent","title":"Grassmann Stein Variational Gradient Descent","date":"2022-02-07","arxiv_id":"2202.03297","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/grassmann-stein-variational-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2202.03297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03297"}},"official":{"repos":["imperialcollegelondon/gsvgd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tts-gan-a-transformer-based-time-series","slug":"tts-gan-a-transformer-based-time-series","title":"TTS-GAN: A Transformer-based Time-Series Generative Adversarial Network","date":"2022-02-06","arxiv_id":"2202.02691","repositories_listed":2,"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/tts-gan-a-transformer-based-time-series#ran","syntology_url":"https://syntology.ai/paper/2202.02691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02691"}},"official":{"repos":["imics-lab/tts-gan"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/approximate-bayesian-computation-with-domain","slug":"approximate-bayesian-computation-with-domain","title":"Approximate Bayesian Computation with Domain Expert in the Loop","date":"2022-01-28","arxiv_id":"2201.12090","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/approximate-bayesian-computation-with-domain#ran","syntology_url":"https://syntology.ai/paper/2201.12090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12090"}},"official":{"repos":["lfilstro/hitl-abc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-discovery-of-new-phases-in","slug":"machine-learning-discovery-of-new-phases-in","title":"Machine learning discovery of new phases in programmable quantum simulator snapshots","date":"2021-12-20","arxiv_id":"2112.10789","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/machine-learning-discovery-of-new-phases-in#ran","syntology_url":"https://syntology.ai/paper/2112.10789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10789"}},"official":{"repos":["KimGroup/QGasML"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/funnels-exact-maximum-likelihood-with","slug":"funnels-exact-maximum-likelihood-with","title":"Funnels: Exact maximum likelihood with dimensionality reduction","date":"2021-12-15","arxiv_id":"2112.08069","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/funnels-exact-maximum-likelihood-with#ran","syntology_url":"https://syntology.ai/paper/2112.08069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08069"}},"official":{"repos":["sambklein/funnels_repo"],"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/triangle-attack-a-query-efficient-decision","slug":"triangle-attack-a-query-efficient-decision","title":"Triangle Attack: A Query-efficient Decision-based Adversarial Attack","date":"2021-12-13","arxiv_id":"2112.06569","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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/triangle-attack-a-query-efficient-decision#ran","syntology_url":"https://syntology.ai/paper/2112.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.06569"}},"official":{"repos":["xiaosen-wang/TA"],"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/learning-compact-representations-of-neural","slug":"learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","arxiv_id":"2110.00684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-compact-representations-of-neural#ran","syntology_url":"https://syntology.ai/paper/2110.00684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00684"}},"official":{"repos":["jayroxis/dam-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/bubblewrap-online-tiling-and-real-time-flow","slug":"bubblewrap-online-tiling-and-real-time-flow","title":"Bubblewrap: Online tiling and real-time flow prediction on neural manifolds","date":"2021-08-31","arxiv_id":"2108.13941","repositories_listed":1,"syntology":{"n":22,"n_ran":17,"n_constructed":2,"n_ran_checked":13,"n_instrument":4,"n_unverified":5,"n_honours":9,"n_violates":2,"n_no_contract":2,"n_pointer_only":22,"phrase":"17 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 9 honoured, 2 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bubblewrap-online-tiling-and-real-time-flow#ran","syntology_url":"https://syntology.ai/paper/2108.13941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13941"}},"official":{"repos":["pearsonlab/bubblewrap"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":2,"n_ran_no_instrument_failure":13,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-for-reduced-order-modelling-and","slug":"deep-learning-for-reduced-order-modelling-and","title":"Deep Learning for Reduced Order Modelling and Efficient Temporal Evolution of Fluid Simulations","date":"2021-07-09","arxiv_id":"2107.04556","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/deep-learning-for-reduced-order-modelling-and#ran","syntology_url":"https://syntology.ai/paper/2107.04556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.04556"}},"official":{"repos":["pranshupant/DL-ROM"],"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/ucsl-a-machine-learning-expectation","slug":"ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","arxiv_id":"2107.01988","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/ucsl-a-machine-learning-expectation#ran","syntology_url":"https://syntology.ai/paper/2107.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01988"}},"official":{"repos":["neurospin-projects/2021_rlouiset_ucsl"],"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/deep-learning-for-functional-data-analysis","slug":"deep-learning-for-functional-data-analysis","title":"Deep Learning for Functional Data Analysis with Adaptive Basis Layers","date":"2021-06-19","arxiv_id":"2106.10414","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/deep-learning-for-functional-data-analysis#ran","syntology_url":"https://syntology.ai/paper/2106.10414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10414"}},"official":{"repos":["jwyyy/AdaFNN"],"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/disentangling-identifiable-features-from","slug":"disentangling-identifiable-features-from","title":"Disentangling Identifiable Features from Noisy Data with Structured Nonlinear ICA","date":"2021-06-17","arxiv_id":"2106.09620","repositories_listed":1,"syntology":{"n":40,"n_ran":23,"n_constructed":0,"n_ran_checked":5,"n_instrument":18,"n_unverified":17,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 18 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/disentangling-identifiable-features-from#ran","syntology_url":"https://syntology.ai/paper/2106.09620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09620"}},"official":{"repos":["HHalva/snica"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":17,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-optimal-transport-map-estimation-1","slug":"large-scale-optimal-transport-map-estimation-1","title":"Large-scale optimal transport map estimation using projection pursuit","date":"2021-06-09","arxiv_id":"2106.05838","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/large-scale-optimal-transport-map-estimation-1#ran","syntology_url":"https://syntology.ai/paper/2106.05838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05838"}},"official":{"repos":["ChengzijunAixiaoli/PPMM"],"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/horopca-hyperbolic-dimensionality-reduction","slug":"horopca-hyperbolic-dimensionality-reduction","title":"HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projections","date":"2021-06-07","arxiv_id":"2106.03306","repositories_listed":1,"syntology":{"n":29,"n_ran":23,"n_constructed":0,"n_ran_checked":1,"n_instrument":22,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":29,"phrase":"23 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; 22 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/horopca-hyperbolic-dimensionality-reduction#ran","syntology_url":"https://syntology.ai/paper/2106.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03306"}},"official":null}},{"url":"/paper/estimating-leverage-scores-via-rank-revealing","slug":"estimating-leverage-scores-via-rank-revealing","title":"Estimating leverage scores via rank revealing methods and randomization","date":"2021-05-23","arxiv_id":"2105.11004","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/estimating-leverage-scores-via-rank-revealing#ran","syntology_url":"https://syntology.ai/paper/2105.11004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11004"}},"official":{"repos":["IBM/pylspack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-spatial-dimensions-of-vision","slug":"rethinking-spatial-dimensions-of-vision","title":"Rethinking Spatial Dimensions of Vision Transformers","date":"2021-03-30","arxiv_id":"2103.16302","repositories_listed":12,"syntology":{"n":20,"n_ran":10,"n_constructed":6,"n_ran_checked":10,"n_instrument":0,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/rethinking-spatial-dimensions-of-vision#ran","syntology_url":"https://syntology.ai/paper/2103.16302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16302"}},"official":{"repos":["naver-ai/pit"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/drop-bottleneck-learning-discrete-compressed-1","slug":"drop-bottleneck-learning-discrete-compressed-1","title":"Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Exploration","date":"2021-03-23","arxiv_id":"2103.12300","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/drop-bottleneck-learning-discrete-compressed-1#ran","syntology_url":"https://syntology.ai/paper/2103.12300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12300"}},"official":{"repos":["jaekyeom/drop-bottleneck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-dynamic-convolution-via-matrix-1","slug":"revisiting-dynamic-convolution-via-matrix-1","title":"Revisiting Dynamic Convolution via Matrix Decomposition","date":"2021-03-15","arxiv_id":"2103.08756","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/revisiting-dynamic-convolution-via-matrix-1#ran","syntology_url":"https://syntology.ai/paper/2103.08756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.08756"}},"official":{"repos":["liyunsheng13/dcd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/center-smoothing-for-certifiably-robust","slug":"center-smoothing-for-certifiably-robust","title":"Center Smoothing: Certified Robustness for Networks with Structured Outputs","date":"2021-02-19","arxiv_id":"2102.09701","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/center-smoothing-for-certifiably-robust#ran","syntology_url":"https://syntology.ai/paper/2102.09701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09701"}},"official":{"repos":["aounon/center-smoothing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-uniformly-stable-algorithm-for-unsupervised","slug":"a-uniformly-stable-algorithm-for-unsupervised","title":"Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm","date":"2020-10-19","arxiv_id":"2010.09416","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/a-uniformly-stable-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2010.09416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09416"}},"official":{"repos":["xinxingwu-uk/ufs"],"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/product-manifold-learning","slug":"product-manifold-learning","title":"Product Manifold Learning","date":"2020-10-19","arxiv_id":"2010.09908","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/product-manifold-learning#ran","syntology_url":"https://syntology.ai/paper/2010.09908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09908"}},"official":{"repos":["sxzhang25/product-manifold-learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sufficient-dimension-reduction-for","slug":"sufficient-dimension-reduction-for","title":"Sufficient dimension reduction for classification using principal optimal transport direction","date":"2020-10-19","arxiv_id":"2010.09921","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/sufficient-dimension-reduction-for#ran","syntology_url":"https://syntology.ai/paper/2010.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09921"}},"official":{"repos":["ChengzijunAixiaoli/POTD"],"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/covariate-shift-adaptation-in-high","slug":"covariate-shift-adaptation-in-high","title":"Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptation","date":"2020-10-02","arxiv_id":"2010.01184","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/covariate-shift-adaptation-in-high#ran","syntology_url":"https://syntology.ai/paper/2010.01184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01184"}},"official":{"repos":["felipemaiapolo/infoselect"],"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/parametric-umap-learning-embeddings-with-deep","slug":"parametric-umap-learning-embeddings-with-deep","title":"Parametric UMAP embeddings for representation and semi-supervised learning","date":"2020-09-27","arxiv_id":"2009.12981","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parametric-umap-learning-embeddings-with-deep#ran","syntology_url":"https://syntology.ai/paper/2009.12981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12981"}},"official":{"repos":["lmcinnes/umap","timsainb/ParametricUMAP_paper"],"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/prottrans-towards-cracking-the-language-of","slug":"prottrans-towards-cracking-the-language-of","title":"ProtTrans: Towards Cracking the Language of Life's Code Through Self-Supervised Deep Learning and High Performance Computing","date":"2020-07-13","arxiv_id":"2007.06225","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/prottrans-towards-cracking-the-language-of#ran","syntology_url":"https://syntology.ai/paper/2007.06225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06225"}},"official":{"repos":["agemagician/ProtTrans"],"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/computing-the-full-signature-kernel-as-the","slug":"computing-the-full-signature-kernel-as-the","title":"The Signature Kernel is the solution of a Goursat PDE","date":"2020-06-26","arxiv_id":"2006.14794","repositories_listed":4,"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":0,"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/computing-the-full-signature-kernel-as-the#ran","syntology_url":"https://syntology.ai/paper/2006.14794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14794"}},"official":{"repos":["crispitagorico/SignatureKernel","crispitagorico/sigkernel"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/markov-lipschitz-deep-learning","slug":"markov-lipschitz-deep-learning","title":"Markov-Lipschitz Deep Learning","date":"2020-06-15","arxiv_id":"2006.08256","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/markov-lipschitz-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2006.08256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08256"}},"official":{"repos":["westlake-cairi/Markov-Lipschitz-Deep-Learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/detection-and-retrieval-of-out-of","slug":"detection-and-retrieval-of-out-of","title":"Detection and Retrieval of Out-of-Distribution Objects in Semantic Segmentation","date":"2020-05-14","arxiv_id":"2005.06831","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/detection-and-retrieval-of-out-of#ran","syntology_url":"https://syntology.ai/paper/2005.06831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.06831"}},"official":{"repos":["RonMcKay/OODRetrieval"],"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/renormalized-mutual-information-for","slug":"renormalized-mutual-information-for","title":"Renormalized Mutual Information for Artificial Scientific Discovery","date":"2020-05-04","arxiv_id":"2005.01912","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/renormalized-mutual-information-for#ran","syntology_url":"https://syntology.ai/paper/2005.01912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01912"}},"official":{"repos":["lsarra/rmi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tired-of-topic-models-clusters-of-pretrained","slug":"tired-of-topic-models-clusters-of-pretrained","title":"Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!","date":"2020-04-30","arxiv_id":"2004.14914","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/tired-of-topic-models-clusters-of-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14914"}},"official":{"repos":["adalmia96/Cluster-Analysis"],"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/supervised-autoencoders-learn-robust-joint","slug":"supervised-autoencoders-learn-robust-joint","title":"Estimating a Brain Network Predictive of Stress and Genotype with Supervised Autoencoders","date":"2020-04-10","arxiv_id":"2004.05209","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supervised-autoencoders-learn-robust-joint#ran","syntology_url":"https://syntology.ai/paper/2004.05209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05209"}},"official":{"repos":["carlson-lab/encodedSupervision"],"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/eca-net-efficient-channel-attention-for-deep","slug":"eca-net-efficient-channel-attention-for-deep","title":"ECA-Net: Efficient Channel Attention for Deep Convolutional Neural Networks","date":"2019-10-08","arxiv_id":"1910.03151","repositories_listed":13,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/eca-net-efficient-channel-attention-for-deep#ran","syntology_url":"https://syntology.ai/paper/1910.03151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03151"}},"official":{"repos":["BangguWu/ECANet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/trimap-large-scale-dimensionality-reduction","slug":"trimap-large-scale-dimensionality-reduction","title":"TriMap: Large-scale Dimensionality Reduction Using Triplets","date":"2019-10-01","arxiv_id":"1910.00204","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trimap-large-scale-dimensionality-reduction#ran","syntology_url":"https://syntology.ai/paper/1910.00204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00204"}},"official":{"repos":["eamid/trimap"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-accurate-network-embeddings-via-very","slug":"fast-and-accurate-network-embeddings-via-very","title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","date":"2019-08-30","arxiv_id":"1908.11512","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/fast-and-accurate-network-embeddings-via-very#ran","syntology_url":"https://syntology.ai/paper/1908.11512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11512"}},"official":{"repos":["GTmac/FastRP"],"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/multivariate-time-series-imputation-with-1","slug":"multivariate-time-series-imputation-with-1","title":"GP-VAE: Deep Probabilistic Time Series Imputation","date":"2019-07-09","arxiv_id":"1907.04155","repositories_listed":4,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/multivariate-time-series-imputation-with-1#ran","syntology_url":"https://syntology.ai/paper/1907.04155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04155"}},"official":{"repos":["ratschlab/GP-VAE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-dynamics-discovery-via-gaussian","slug":"neural-dynamics-discovery-via-gaussian","title":"Neural Dynamics Discovery via Gaussian Process Recurrent Neural Networks","date":"2019-07-01","arxiv_id":"1907.00650","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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/neural-dynamics-discovery-via-gaussian#ran","syntology_url":"https://syntology.ai/paper/1907.00650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00650"}},"official":{"repos":["sheqi/GP-RNN_UAI2019"],"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/autonomous-skill-discovery-with-quality","slug":"autonomous-skill-discovery-with-quality","title":"Autonomous skill discovery with Quality-Diversity and Unsupervised Descriptors","date":"2019-05-28","arxiv_id":"1905.11874","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":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/autonomous-skill-discovery-with-quality#ran","syntology_url":"https://syntology.ai/paper/1905.11874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11874"}},"official":null}},{"url":"/paper/text-classification-algorithms-a-survey","slug":"text-classification-algorithms-a-survey","title":"Text Classification Algorithms: A Survey","date":"2019-04-17","arxiv_id":"1904.08067","repositories_listed":2,"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/text-classification-algorithms-a-survey#ran","syntology_url":"https://syntology.ai/paper/1904.08067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08067"}},"official":{"repos":["kk7nc/Text_Classification"],"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/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}},"official":null}},{"url":"/paper/elki-a-large-open-source-library-for-data","slug":"elki-a-large-open-source-library-for-data","title":"ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 \"Heidelberg\"","date":"2019-02-10","arxiv_id":"1902.03616","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/elki-a-large-open-source-library-for-data#ran","syntology_url":"https://syntology.ai/paper/1902.03616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03616"}},"official":{"repos":["elki-project/elki"],"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/unsupervised-learning-with-contrastive-latent","slug":"unsupervised-learning-with-contrastive-latent","title":"Unsupervised learning with contrastive latent variable models","date":"2018-11-14","arxiv_id":"1811.06094","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-learning-with-contrastive-latent#ran","syntology_url":"https://syntology.ai/paper/1811.06094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06094"}},"official":{"repos":["kseverso/contrastive-LVM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/failing-loudly-an-empirical-study-of-methods","slug":"failing-loudly-an-empirical-study-of-methods","title":"Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shift","date":"2018-10-29","arxiv_id":"1810.11953","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/failing-loudly-an-empirical-study-of-methods#ran","syntology_url":"https://syntology.ai/paper/1810.11953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11953"}},"official":{"repos":["steverab/failing-loudly"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/catboost-gradient-boosting-with-categorical","slug":"catboost-gradient-boosting-with-categorical","title":"CatBoost: gradient boosting with categorical features support","date":"2018-10-24","arxiv_id":"1810.11363","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/catboost-gradient-boosting-with-categorical#ran","syntology_url":"https://syntology.ai/paper/1810.11363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11363"}},"official":{"repos":["catboost/catboost"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/t-sne-cuda-gpu-accelerated-t-sne-and-its","slug":"t-sne-cuda-gpu-accelerated-t-sne-and-its","title":"t-SNE-CUDA: GPU-Accelerated t-SNE and its Applications to Modern Data","date":"2018-07-31","arxiv_id":"1807.11824","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/t-sne-cuda-gpu-accelerated-t-sne-and-its#ran","syntology_url":"https://syntology.ai/paper/1807.11824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.11824"}},"official":{"repos":["CannyLab/tsne-cuda"],"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/som-vae-interpretable-discrete-representation","slug":"som-vae-interpretable-discrete-representation","title":"SOM-VAE: Interpretable Discrete Representation Learning on Time Series","date":"2018-06-06","arxiv_id":"1806.02199","repositories_listed":6,"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/som-vae-interpretable-discrete-representation#ran","syntology_url":"https://syntology.ai/paper/1806.02199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02199"}},"official":{"repos":["ratschlab/SOM-VAE"],"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/reservoir-computing-approaches-for","slug":"reservoir-computing-approaches-for","title":"Reservoir computing approaches for representation and classification of multivariate time series","date":"2018-03-21","arxiv_id":"1803.07870","repositories_listed":3,"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/reservoir-computing-approaches-for#ran","syntology_url":"https://syntology.ai/paper/1803.07870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07870"}},"official":{"repos":["FilippoMB/Reservoir-Computing-framework-for-multivariate-time-series-classification","FilippoMB/Reservoir-model-space-classifier"],"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/convex-formulations-for-fair-principal","slug":"convex-formulations-for-fair-principal","title":"Convex Formulations for Fair Principal Component Analysis","date":"2018-02-11","arxiv_id":"1802.03765","repositories_listed":2,"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/convex-formulations-for-fair-principal#ran","syntology_url":"https://syntology.ai/paper/1802.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03765"}},"official":{"repos":["molfat66/FairML"],"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/learning-neural-representations-of-human","slug":"learning-neural-representations-of-human","title":"Learning Neural Representations of Human Cognition across Many fMRI Studies","date":"2017-10-31","arxiv_id":"1710.11438","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-neural-representations-of-human#ran","syntology_url":"https://syntology.ai/paper/1710.11438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11438"}},"official":{"repos":["arthurmensch/cogspaces"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/vampnets-deep-learning-of-molecular-kinetics","slug":"vampnets-deep-learning-of-molecular-kinetics","title":"VAMPnets: Deep learning of molecular kinetics","date":"2017-10-16","arxiv_id":"1710.06012","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vampnets-deep-learning-of-molecular-kinetics#ran","syntology_url":"https://syntology.ai/paper/1710.06012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.06012"}},"official":{"repos":["markovmodel/deeptime"],"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/zoo-zeroth-order-optimization-based-black-box","slug":"zoo-zeroth-order-optimization-based-black-box","title":"ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models","date":"2017-08-14","arxiv_id":"1708.03999","repositories_listed":5,"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/zoo-zeroth-order-optimization-based-black-box#ran","syntology_url":"https://syntology.ai/paper/1708.03999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.03999"}},"official":{"repos":["huanzhang12/ZOO-Attack"],"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/accelerated-stochastic-power-iteration","slug":"accelerated-stochastic-power-iteration","title":"Accelerated Stochastic Power Iteration","date":"2017-07-10","arxiv_id":"1707.02670","repositories_listed":2,"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/accelerated-stochastic-power-iteration#ran","syntology_url":"https://syntology.ai/paper/1707.02670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.02670"}},"official":null}},{"url":"/paper/kernel-feature-selection-via-conditional","slug":"kernel-feature-selection-via-conditional","title":"Kernel Feature Selection via Conditional Covariance Minimization","date":"2017-07-04","arxiv_id":"1707.01164","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/kernel-feature-selection-via-conditional#ran","syntology_url":"https://syntology.ai/paper/1707.01164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.01164"}},"official":{"repos":["Jianbo-Lab/CCM"],"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/towards-k-means-friendly-spaces-simultaneous","slug":"towards-k-means-friendly-spaces-simultaneous","title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering","date":"2016-10-15","arxiv_id":"1610.04794","repositories_listed":11,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-k-means-friendly-spaces-simultaneous#ran","syntology_url":"https://syntology.ai/paper/1610.04794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.04794"}},"official":{"repos":["boyangumn/DCN"],"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-primer-on-the-signature-method-in-machine","slug":"a-primer-on-the-signature-method-in-machine","title":"A Primer on the Signature Method in Machine Learning","date":"2016-03-11","arxiv_id":"1603.03788","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-primer-on-the-signature-method-in-machine#ran","syntology_url":"https://syntology.ai/paper/1603.03788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.03788"}},"official":{"repos":["patrick-kidger/signatory"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/mxnet-a-flexible-and-efficient-machine","slug":"mxnet-a-flexible-and-efficient-machine","title":"MXNet: A Flexible and Efficient Machine Learning Library for Heterogeneous Distributed Systems","date":"2015-12-03","arxiv_id":"1512.01274","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/mxnet-a-flexible-and-efficient-machine#ran","syntology_url":"https://syntology.ai/paper/1512.01274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.01274"}},"official":null}},{"url":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","repositories_listed":29,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}},"official":null}},{"url":"/paper/approximating-likelihood-ratios-with","slug":"approximating-likelihood-ratios-with","title":"Approximating Likelihood Ratios with Calibrated Discriminative Classifiers","date":"2015-06-06","arxiv_id":"1506.02169","repositories_listed":2,"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":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/approximating-likelihood-ratios-with#ran","syntology_url":"https://syntology.ai/paper/1506.02169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.02169"}},"official":{"repos":["diana-hep/carl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/demixed-principal-component-analysis-of","slug":"demixed-principal-component-analysis-of","title":"Demixed principal component analysis of population activity in higher cortical areas reveals independent representation of task parameters","date":"2014-10-22","arxiv_id":"1410.6031","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/demixed-principal-component-analysis-of#ran","syntology_url":"https://syntology.ai/paper/1410.6031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.6031"}},"official":{"repos":["wielandbrendel/dPCA"],"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/scikit-learn-machine-learning-in-python","slug":"scikit-learn-machine-learning-in-python","title":"Scikit-learn: Machine Learning in Python","date":"2012-01-02","arxiv_id":"1201.0490","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scikit-learn-machine-learning-in-python#ran","syntology_url":"https://syntology.ai/paper/1201.0490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1201.0490"}},"official":null}},{"url":"/paper/vector-diffusion-maps-and-the-connection","slug":"vector-diffusion-maps-and-the-connection","title":"Vector Diffusion Maps and the Connection Laplacian","date":"2011-02-01","arxiv_id":"1102.0075","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vector-diffusion-maps-and-the-connection#ran","syntology_url":"https://syntology.ai/paper/1102.0075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1102.0075"}},"official":null}}],"record_sha256":"c4a2a2cfe69332938e54a8e2530fbf020bfc733db7fe61d346c9ac218545ca09","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}