{"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/clustering/papers/ran/4","list_of":"/task/clustering","task":"Clustering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":419,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"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/clustering/papers/ran/1","prev":"/task/clustering/papers/ran/3","next":"/task/clustering/papers/ran/5","papers":[{"url":"/paper/unsupervised-domain-adaptation-via-4","slug":"unsupervised-domain-adaptation-via-4","title":"Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering","date":"2020-03-19","arxiv_id":"2003.08607","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-domain-adaptation-via-4#ran","syntology_url":"https://syntology.ai/paper/2003.08607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08607"}},"official":{"repos":["huitangtang/SRDC-CVPR2020"],"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/building-and-interpreting-deep-similarity","slug":"building-and-interpreting-deep-similarity","title":"Building and Interpreting Deep Similarity Models","date":"2020-03-11","arxiv_id":"2003.05431","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/building-and-interpreting-deep-similarity#ran","syntology_url":"https://syntology.ai/paper/2003.05431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05431"}},"official":null}},{"url":"/paper/embedding-expansion-augmentation-in-embedding","slug":"embedding-expansion-augmentation-in-embedding","title":"Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learning","date":"2020-03-05","arxiv_id":"2003.02546","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/embedding-expansion-augmentation-in-embedding#ran","syntology_url":"https://syntology.ai/paper/2003.02546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02546"}},"official":{"repos":["clovaai/embedding-expansion"],"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/explainable-k-means-and-k-medians-clustering","slug":"explainable-k-means-and-k-medians-clustering","title":"Explainable $k$-Means and $k$-Medians Clustering","date":"2020-02-28","arxiv_id":"2002.12538","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explainable-k-means-and-k-medians-clustering#ran","syntology_url":"https://syntology.ai/paper/2002.12538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12538"}},"official":{"repos":["navefr/ExKMC"],"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/compact-representation-of-uncertainty-in-1","slug":"compact-representation-of-uncertainty-in-1","title":"Data Structures & Algorithms for Exact Inference in Hierarchical Clustering","date":"2020-02-26","arxiv_id":"2002.11661","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/compact-representation-of-uncertainty-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.11661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11661"}},"official":null}},{"url":"/paper/set2graph-learning-graphs-from-sets","slug":"set2graph-learning-graphs-from-sets","title":"Set2Graph: Learning Graphs From Sets","date":"2020-02-20","arxiv_id":"2002.08772","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/set2graph-learning-graphs-from-sets#ran","syntology_url":"https://syntology.ai/paper/2002.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08772"}},"official":{"repos":["hadarser/SetToGraphPaper"],"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/learning-to-group-a-bottom-up-framework-for-1","slug":"learning-to-group-a-bottom-up-framework-for-1","title":"Learning to Group: A Bottom-Up Framework for 3D Part Discovery in Unseen Categories","date":"2020-02-16","arxiv_id":"2002.06478","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/learning-to-group-a-bottom-up-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2002.06478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06478"}},"official":{"repos":["tiangeluo/Learning-to-Group"],"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/key-points-estimation-and-point-instance","slug":"key-points-estimation-and-point-instance","title":"Key Points Estimation and Point Instance Segmentation Approach for Lane Detection","date":"2020-02-16","arxiv_id":"2002.06604","repositories_listed":10,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/key-points-estimation-and-point-instance#ran","syntology_url":"https://syntology.ai/paper/2002.06604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06604"}},"official":{"repos":["koyeongmin/PINet","koyeongmin/PINet_new"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/co-optimal-transport","slug":"co-optimal-transport","title":"CO-Optimal Transport","date":"2020-02-10","arxiv_id":"2002.03731","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/co-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2002.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03731"}},"official":{"repos":["PythonOT/COOT"],"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/structural-deep-clustering-network","slug":"structural-deep-clustering-network","title":"Structural Deep Clustering Network","date":"2020-02-05","arxiv_id":"2002.01633","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":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structural-deep-clustering-network#ran","syntology_url":"https://syntology.ai/paper/2002.01633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01633"}},"official":{"repos":["bdy9527/SDCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-explicit-local-and-global-representation","slug":"an-explicit-local-and-global-representation","title":"An Explicit Local and Global Representation Disentanglement Framework with Applications in Deep Clustering and Unsupervised Object Detection","date":"2020-01-24","arxiv_id":"2001.08957","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"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) · 7 unverified","sample_list":"/paper/an-explicit-local-and-global-representation#ran","syntology_url":"https://syntology.ai/paper/2001.08957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08957"}},"official":{"repos":["51616/split-vae"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/mutual-mean-teaching-pseudo-label-refinery-1","slug":"mutual-mean-teaching-pseudo-label-refinery-1","title":"Mutual Mean-Teaching: Pseudo Label Refinery for Unsupervised Domain Adaptation on Person Re-identification","date":"2020-01-06","arxiv_id":"2001.01526","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":2,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mutual-mean-teaching-pseudo-label-refinery-1#ran","syntology_url":"https://syntology.ai/paper/2001.01526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01526"}},"official":{"repos":["yxgeee/MMT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-new-burrows-wheeler-transform-markov","slug":"a-new-burrows-wheeler-transform-markov","title":"A New Burrows Wheeler Transform Markov Distance","date":"2019-12-30","arxiv_id":"1912.13046","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-burrows-wheeler-transform-markov#ran","syntology_url":"https://syntology.ai/paper/1912.13046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13046"}},"official":null}},{"url":"/paper/unsupervised-change-detection-in-multi","slug":"unsupervised-change-detection-in-multi","title":"Unsupervised Change Detection in Multi-temporal VHR Images Based on Deep Kernel PCA Convolutional Mapping Network","date":"2019-12-18","arxiv_id":"1912.08628","repositories_listed":3,"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/unsupervised-change-detection-in-multi#ran","syntology_url":"https://syntology.ai/paper/1912.08628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08628"}},"official":null}},{"url":"/paper/balancing-the-tradeoff-between-clustering","slug":"balancing-the-tradeoff-between-clustering","title":"Balancing the Tradeoff Between Clustering Value and Interpretability","date":"2019-12-17","arxiv_id":"1912.07820","repositories_listed":1,"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/balancing-the-tradeoff-between-clustering#ran","syntology_url":"https://syntology.ai/paper/1912.07820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07820"}},"official":{"repos":["sandysa/Interpretable_Clustering"],"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/the-group-loss-for-deep-metric-learning","slug":"the-group-loss-for-deep-metric-learning","title":"The Group Loss for Deep Metric Learning","date":"2019-12-01","arxiv_id":"1912.00385","repositories_listed":2,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/the-group-loss-for-deep-metric-learning#ran","syntology_url":"https://syntology.ai/paper/1912.00385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00385"}},"official":{"repos":["dvl-tum/group_loss"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/self-labelling-via-simultaneous-clustering-1","slug":"self-labelling-via-simultaneous-clustering-1","title":"Self-labelling via simultaneous clustering and representation learning","date":"2019-11-13","arxiv_id":"1911.05371","repositories_listed":5,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-labelling-via-simultaneous-clustering-1#ran","syntology_url":"https://syntology.ai/paper/1911.05371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05371"}},"official":{"repos":["yukimasano/self-label"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/a-coupled-autoencoder-approach-for-multi-1","slug":"a-coupled-autoencoder-approach-for-multi-1","title":"A coupled autoencoder approach for multi-modal analysis of cell types","date":"2019-11-06","arxiv_id":"1911.05663","repositories_listed":1,"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/a-coupled-autoencoder-approach-for-multi-1#ran","syntology_url":"https://syntology.ai/paper/1911.05663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05663"}},"official":{"repos":["AllenInstitute/coupledAE"],"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/hierarchical-mixtures-of-generators-for","slug":"hierarchical-mixtures-of-generators-for","title":"Hierarchical Mixtures of Generators for Adversarial Learning","date":"2019-11-05","arxiv_id":"1911.02069","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/hierarchical-mixtures-of-generators-for#ran","syntology_url":"https://syntology.ai/paper/1911.02069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02069"}},"official":{"repos":["alper111/hmog"],"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/spherical-text-embedding","slug":"spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","arxiv_id":"1911.01196","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spherical-text-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.01196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01196"}},"official":{"repos":["yumeng5/Spherical-Text-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-prototypical-triplet-loss-for-cover","slug":"a-prototypical-triplet-loss-for-cover","title":"A Prototypical Triplet Loss for Cover Detection","date":"2019-10-22","arxiv_id":"1910.09862","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/a-prototypical-triplet-loss-for-cover#ran","syntology_url":"https://syntology.ai/paper/1910.09862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09862"}},"official":{"repos":["gdoras/PrototypicalTripletLoss"],"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/mixture-of-experts-variational-autoencoder","slug":"mixture-of-experts-variational-autoencoder","title":"Mixture-of-Experts Variational Autoencoder for Clustering and Generating from Similarity-Based Representations on Single Cell Data","date":"2019-10-17","arxiv_id":"1910.07763","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":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mixture-of-experts-variational-autoencoder#ran","syntology_url":"https://syntology.ai/paper/1910.07763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07763"}},"official":{"repos":["andkopf/MoESimVAE"],"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/segsort-segmentation-by-discriminative","slug":"segsort-segmentation-by-discriminative","title":"SegSort: Segmentation by Discriminative Sorting of Segments","date":"2019-10-15","arxiv_id":"1910.06962","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/segsort-segmentation-by-discriminative#ran","syntology_url":"https://syntology.ai/paper/1910.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06962"}},"official":null}},{"url":"/paper/vq-wav2vec-self-supervised-learning-of-1","slug":"vq-wav2vec-self-supervised-learning-of-1","title":"vq-wav2vec: Self-Supervised Learning of Discrete Speech Representations","date":"2019-10-12","arxiv_id":"1910.05453","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vq-wav2vec-self-supervised-learning-of-1#ran","syntology_url":"https://syntology.ai/paper/1910.05453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05453"}},"official":null}},{"url":"/paper/clustered-federated-learning-model-agnostic","slug":"clustered-federated-learning-model-agnostic","title":"Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraints","date":"2019-10-04","arxiv_id":"1910.01991","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/clustered-federated-learning-model-agnostic#ran","syntology_url":"https://syntology.ai/paper/1910.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01991"}},"official":null}},{"url":"/paper/end-to-end-neural-speaker-diarization-with","slug":"end-to-end-neural-speaker-diarization-with","title":"End-to-End Neural Speaker Diarization with Self-attention","date":"2019-09-13","arxiv_id":"1909.06247","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/end-to-end-neural-speaker-diarization-with#ran","syntology_url":"https://syntology.ai/paper/1909.06247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06247"}},"official":{"repos":["hitachi-speech/EEND"],"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/sentence-bert-sentence-embeddings-using","slug":"sentence-bert-sentence-embeddings-using","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","date":"2019-08-27","arxiv_id":"1908.10084","repositories_listed":64,"syntology":{"n":58,"n_ran":33,"n_constructed":9,"n_ran_checked":30,"n_instrument":3,"n_unverified":25,"n_honours":1,"n_violates":0,"n_no_contract":29,"n_pointer_only":11,"phrase":"33 ran (of which 9 constructed an object rather than computing a result; 30 with no instrument failure: 1 honoured, 0 violated, 29 with no contract checked; 3 where Syntology's instrument failed) · 25 unverified","sample_list":"/paper/sentence-bert-sentence-embeddings-using#ran","syntology_url":"https://syntology.ai/paper/1908.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10084"}},"official":{"repos":["UKPLab/sentence-transformers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-discover-novel-visual-categories","slug":"learning-to-discover-novel-visual-categories","title":"Learning to Discover Novel Visual Categories via Deep Transfer Clustering","date":"2019-08-26","arxiv_id":"1908.09884","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/learning-to-discover-novel-visual-categories#ran","syntology_url":"https://syntology.ai/paper/1908.09884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09884"}},"official":{"repos":["k-han/DTC"],"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/n2dnot-too-deep-clustering-via-clustering-the","slug":"n2dnot-too-deep-clustering-via-clustering-the","title":"N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding","date":"2019-08-16","arxiv_id":"1908.05968","repositories_listed":5,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/n2dnot-too-deep-clustering-via-clustering-the#ran","syntology_url":"https://syntology.ai/paper/1908.05968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05968"}},"official":{"repos":["rymc/n2d"],"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/correlation-clustering-with-same-cluster","slug":"correlation-clustering-with-same-cluster","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","date":"2019-08-14","arxiv_id":"1908.04976","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/correlation-clustering-with-same-cluster#ran","syntology_url":"https://syntology.ai/paper/1908.04976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04976"}},"official":{"repos":["sanjayss34/corr-clust-query-esa2019"],"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/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}},"official":{"repos":["MysteryVaibhav/DW-GAE"],"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/symmetric-graph-convolutional-autoencoder-for","slug":"symmetric-graph-convolutional-autoencoder-for","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","date":"2019-08-07","arxiv_id":"1908.02441","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/symmetric-graph-convolutional-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1908.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.02441"}},"official":null}},{"url":"/paper/making-ai-forget-you-data-deletion-in-machine","slug":"making-ai-forget-you-data-deletion-in-machine","title":"Making AI Forget You: Data Deletion in Machine Learning","date":"2019-07-11","arxiv_id":"1907.05012","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/making-ai-forget-you-data-deletion-in-machine#ran","syntology_url":"https://syntology.ai/paper/1907.05012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05012"}},"official":{"repos":["tginart/deletion-efficient-kmeans"],"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/coarse-graining-of-data-via-inhomogeneous","slug":"coarse-graining-of-data-via-inhomogeneous","title":"Coarse Graining of Data via Inhomogeneous Diffusion Condensation","date":"2019-07-10","arxiv_id":"1907.04463","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/coarse-graining-of-data-via-inhomogeneous#ran","syntology_url":"https://syntology.ai/paper/1907.04463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04463"}},"official":{"repos":["matthew-hirn/condensation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-spectral-approach-to-unsupervised-object","slug":"a-spectral-approach-to-unsupervised-object","title":"A 3D Convolutional Approach to Spectral Object Segmentation in Space and Time","date":"2019-07-05","arxiv_id":"1907.02731","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/a-spectral-approach-to-unsupervised-object#ran","syntology_url":"https://syntology.ai/paper/1907.02731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02731"}},"official":{"repos":["bit-ml/sfseg"],"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/a-flexible-em-like-clustering-algorithm-for","slug":"a-flexible-em-like-clustering-algorithm-for","title":"A flexible EM-like clustering algorithm for noisy data","date":"2019-07-02","arxiv_id":"1907.01660","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":1,"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, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-flexible-em-like-clustering-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/1907.01660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01660"}},"official":{"repos":["violetr/fem"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"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":1,"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/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/instance-segmentation-by-jointly-optimizing-1","slug":"instance-segmentation-by-jointly-optimizing-1","title":"Instance Segmentation by Jointly Optimizing Spatial Embeddings and Clustering Bandwidth","date":"2019-06-26","arxiv_id":"1906.11109","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instance-segmentation-by-jointly-optimizing-1#ran","syntology_url":"https://syntology.ai/paper/1906.11109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.11109"}},"official":{"repos":["davyneven/SpatialEmbeddings"],"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/dlime-a-deterministic-local-interpretable","slug":"dlime-a-deterministic-local-interpretable","title":"DLIME: A Deterministic Local Interpretable Model-Agnostic Explanations Approach for Computer-Aided Diagnosis Systems","date":"2019-06-24","arxiv_id":"1906.10263","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/dlime-a-deterministic-local-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.10263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10263"}},"official":{"repos":["rehmanzafar/dlime_experiments"],"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/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/divide-and-conquer-the-embedding-space-for-1","slug":"divide-and-conquer-the-embedding-space-for-1","title":"Divide and Conquer the Embedding Space for Metric Learning","date":"2019-06-14","arxiv_id":"1906.05990","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/divide-and-conquer-the-embedding-space-for-1#ran","syntology_url":"https://syntology.ai/paper/1906.05990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05990"}},"official":null}},{"url":"/paper/learning-object-bounding-boxes-for-3d","slug":"learning-object-bounding-boxes-for-3d","title":"Learning Object Bounding Boxes for 3D Instance Segmentation on Point Clouds","date":"2019-06-04","arxiv_id":"1906.01140","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":1,"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-object-bounding-boxes-for-3d#ran","syntology_url":"https://syntology.ai/paper/1906.01140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01140"}},"official":{"repos":["Yang7879/3D-BoNet"],"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/190510350","slug":"190510350","title":"Unsupervised Community Detection with Modularity-Based Attention Model","date":"2019-05-20","arxiv_id":"1905.10350","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190510350#ran","syntology_url":"https://syntology.ai/paper/1905.10350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10350"}},"official":{"repos":["Ivanopolo/modnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-gromov-wasserstein-learning-for","slug":"scalable-gromov-wasserstein-learning-for","title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","date":"2019-05-18","arxiv_id":"1905.07645","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/scalable-gromov-wasserstein-learning-for#ran","syntology_url":"https://syntology.ai/paper/1905.07645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07645"}},"official":{"repos":["HongtengXu/s-gwl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/correlated-variational-auto-encoders","slug":"correlated-variational-auto-encoders","title":"Correlated Variational Auto-Encoders","date":"2019-05-14","arxiv_id":"1905.05335","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/correlated-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1905.05335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05335"}},"official":{"repos":["datang1992/Correlated-VAEs"],"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/edge-labeling-graph-neural-network-for-few","slug":"edge-labeling-graph-neural-network-for-few","title":"Edge-labeling Graph Neural Network for Few-shot Learning","date":"2019-05-04","arxiv_id":"1905.01436","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/edge-labeling-graph-neural-network-for-few#ran","syntology_url":"https://syntology.ai/paper/1905.01436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01436"}},"official":{"repos":["khy0809/fewshot-egnn"],"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/deep-constrained-dominant-sets-for-person-re","slug":"deep-constrained-dominant-sets-for-person-re","title":"Deep Constrained Dominant Sets for Person Re-identification","date":"2019-04-25","arxiv_id":"1904.11397","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/deep-constrained-dominant-sets-for-person-re#ran","syntology_url":"https://syntology.ai/paper/1904.11397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11397"}},"official":null}},{"url":"/paper/multi-interest-network-with-dynamic-routing","slug":"multi-interest-network-with-dynamic-routing","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","date":"2019-04-17","arxiv_id":"1904.08030","repositories_listed":6,"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/multi-interest-network-with-dynamic-routing#ran","syntology_url":"https://syntology.ai/paper/1904.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08030"}},"official":null}},{"url":"/paper/clustered-object-detection-in-aerial-images","slug":"clustered-object-detection-in-aerial-images","title":"Clustered Object Detection in Aerial Images","date":"2019-04-16","arxiv_id":"1904.08008","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/clustered-object-detection-in-aerial-images#ran","syntology_url":"https://syntology.ai/paper/1904.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08008"}},"official":null}},{"url":"/paper/relation-aware-global-attention","slug":"relation-aware-global-attention","title":"Relation-Aware Global Attention for Person Re-identification","date":"2019-04-05","arxiv_id":"1904.02998","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/relation-aware-global-attention#ran","syntology_url":"https://syntology.ai/paper/1904.02998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02998"}},"official":{"repos":["microsoft/Relation-Aware-Global-Attention-Networks"],"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/learning-to-cluster-faces-on-an-affinity","slug":"learning-to-cluster-faces-on-an-affinity","title":"Learning to Cluster Faces on an Affinity Graph","date":"2019-04-04","arxiv_id":"1904.02749","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-cluster-faces-on-an-affinity#ran","syntology_url":"https://syntology.ai/paper/1904.02749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02749"}},"official":{"repos":["yl-1993/learn-to-cluster"],"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/unsupervised-continual-learning-and-self","slug":"unsupervised-continual-learning-and-self","title":"Unsupervised Progressive Learning and the STAM Architecture","date":"2019-04-03","arxiv_id":"1904.02021","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/unsupervised-continual-learning-and-self#ran","syntology_url":"https://syntology.ai/paper/1904.02021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02021"}},"official":{"repos":["CameronTaylorFL/stam"],"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/linkage-based-face-clustering-via-graph","slug":"linkage-based-face-clustering-via-graph","title":"Linkage Based Face Clustering via Graph Convolution Network","date":"2019-03-27","arxiv_id":"1903.11306","repositories_listed":4,"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":1,"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/linkage-based-face-clustering-via-graph#ran","syntology_url":"https://syntology.ai/paper/1903.11306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11306"}},"official":{"repos":["Zhongdao/gcn_clustering"],"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/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}},"official":{"repos":["thudzj/CAT"],"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/efficient-parameter-free-clustering-using","slug":"efficient-parameter-free-clustering-using","title":"Efficient Parameter-free Clustering Using First Neighbor Relations","date":"2019-02-28","arxiv_id":"1902.11266","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":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/efficient-parameter-free-clustering-using#ran","syntology_url":"https://syntology.ai/paper/1902.11266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.11266"}},"official":{"repos":["ssarfraz/FINCH-CLustering"],"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/single-image-piece-wise-planar-3d","slug":"single-image-piece-wise-planar-3d","title":"Single-Image Piece-wise Planar 3D Reconstruction via Associative Embedding","date":"2019-02-26","arxiv_id":"1902.09777","repositories_listed":1,"syntology":{"n":13,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 11 unverified","sample_list":"/paper/single-image-piece-wise-planar-3d#ran","syntology_url":"https://syntology.ai/paper/1902.09777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09777"}},"official":{"repos":["svip-lab/PlanarReconstruction"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/centroid-networks-for-few-shot-clustering-and","slug":"centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","arxiv_id":"1902.08605","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/centroid-networks-for-few-shot-clustering-and#ran","syntology_url":"https://syntology.ai/paper/1902.08605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08605"}},"official":null}},{"url":"/paper/learning-representations-of-irregular","slug":"learning-representations-of-irregular","title":"Learning representations of irregular particle-detector geometry with distance-weighted graph networks","date":"2019-02-21","arxiv_id":"1902.07987","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/learning-representations-of-irregular#ran","syntology_url":"https://syntology.ai/paper/1902.07987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07987"}},"official":{"repos":["jkiesele/caloGraphNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/scalable-fair-clustering","slug":"scalable-fair-clustering","title":"Scalable Fair Clustering","date":"2019-02-10","arxiv_id":"1902.03519","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/1902.03519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03519"}},"official":{"repos":["talwagner/fair_clustering"],"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/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/stampnet-unsupervised-multi-class-object","slug":"stampnet-unsupervised-multi-class-object","title":"StampNet: unsupervised multi-class object discovery","date":"2019-02-07","arxiv_id":"1902.02693","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":1,"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/stampnet-unsupervised-multi-class-object#ran","syntology_url":"https://syntology.ai/paper/1902.02693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.02693"}},"official":null}},{"url":"/paper/meta-amortized-variational-inference-and","slug":"meta-amortized-variational-inference-and","title":"Meta-Amortized Variational Inference and Learning","date":"2019-02-05","arxiv_id":"1902.01950","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/meta-amortized-variational-inference-and#ran","syntology_url":"https://syntology.ai/paper/1902.01950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01950"}},"official":null}},{"url":"/paper/provably-efficient-rl-with-rich-observations","slug":"provably-efficient-rl-with-rich-observations","title":"Provably efficient RL with Rich Observations via Latent State Decoding","date":"2019-01-25","arxiv_id":"1901.09018","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/provably-efficient-rl-with-rich-observations#ran","syntology_url":"https://syntology.ai/paper/1901.09018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09018"}},"official":{"repos":["Microsoft/StateDecoding"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/max-margin-class-imbalanced-learning-with","slug":"max-margin-class-imbalanced-learning-with","title":"Max-margin Class Imbalanced Learning with Gaussian Affinity","date":"2019-01-23","arxiv_id":"1901.07711","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/max-margin-class-imbalanced-learning-with#ran","syntology_url":"https://syntology.ai/paper/1901.07711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07711"}},"official":null}},{"url":"/paper/object-centric-auto-encoders-and-dummy","slug":"object-centric-auto-encoders-and-dummy","title":"Object-centric Auto-encoders and Dummy Anomalies for Abnormal Event Detection in Video","date":"2018-12-11","arxiv_id":"1812.04960","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/object-centric-auto-encoders-and-dummy#ran","syntology_url":"https://syntology.ai/paper/1812.04960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.04960"}},"official":null}},{"url":"/paper/q-means-a-quantum-algorithm-for-unsupervised","slug":"q-means-a-quantum-algorithm-for-unsupervised","title":"q-means: A quantum algorithm for unsupervised machine learning","date":"2018-12-10","arxiv_id":"1812.03584","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/q-means-a-quantum-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1812.03584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03584"}},"official":{"repos":["JonasLandman/quantum_kmeans_NeurIPS_2019"],"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/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}},"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-part-detection-via-matching-learning","slug":"semantic-part-detection-via-matching-learning","title":"Semantic Part Detection via Matching: Learning to Generalize to Novel Viewpoints from Limited Training Data","date":"2018-11-28","arxiv_id":"1811.11823","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semantic-part-detection-via-matching-learning#ran","syntology_url":"https://syntology.ai/paper/1811.11823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11823"}},"official":{"repos":["ytongbai/SemanticPartDetection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-deep-clustering-for-source","slug":"unsupervised-deep-clustering-for-source","title":"Unsupervised Deep Clustering for Source Separation: Direct Learning from Mixtures using Spatial Information","date":"2018-11-05","arxiv_id":"1811.01531","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/unsupervised-deep-clustering-for-source#ran","syntology_url":"https://syntology.ai/paper/1811.01531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01531"}},"official":{"repos":["etzinis/unsupervised_spatial_dc"],"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/foundations-of-comparison-based-hierarchical","slug":"foundations-of-comparison-based-hierarchical","title":"Foundations of Comparison-Based Hierarchical Clustering","date":"2018-11-02","arxiv_id":"1811.00928","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/foundations-of-comparison-based-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1811.00928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00928"}},"official":{"repos":["mperrot/ComparisonHC"],"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/scalable-laplacian-k-modes","slug":"scalable-laplacian-k-modes","title":"Scalable Laplacian K-modes","date":"2018-10-31","arxiv_id":"1810.13044","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-laplacian-k-modes#ran","syntology_url":"https://syntology.ai/paper/1810.13044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.13044"}},"official":{"repos":["imtiazziko/SLK"],"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/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/causal-inference-and-mechanism-clustering-of","slug":"causal-inference-and-mechanism-clustering-of","title":"Causal Inference and Mechanism Clustering of A Mixture of Additive Noise Models","date":"2018-09-23","arxiv_id":"1809.08568","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/causal-inference-and-mechanism-clustering-of#ran","syntology_url":"https://syntology.ai/paper/1809.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.08568"}},"official":{"repos":["amber0309/ANM-MM"],"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/clustergan-latent-space-clustering-in","slug":"clustergan-latent-space-clustering-in","title":"ClusterGAN : Latent Space Clustering in Generative Adversarial Networks","date":"2018-09-10","arxiv_id":"1809.03627","repositories_listed":7,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/clustergan-latent-space-clustering-in#ran","syntology_url":"https://syntology.ai/paper/1809.03627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03627"}},"official":null}},{"url":"/paper/invariant-information-distillation-for","slug":"invariant-information-distillation-for","title":"Invariant Information Clustering for Unsupervised Image Classification and Segmentation","date":"2018-07-17","arxiv_id":"1807.06653","repositories_listed":6,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/invariant-information-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1807.06653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06653"}},"official":{"repos":["xu-ji/IIC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-clustering-for-unsupervised-learning-of","slug":"deep-clustering-for-unsupervised-learning-of","title":"Deep Clustering for Unsupervised Learning of Visual Features","date":"2018-07-15","arxiv_id":"1807.05520","repositories_listed":9,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-clustering-for-unsupervised-learning-of#ran","syntology_url":"https://syntology.ai/paper/1807.05520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05520"}},"official":{"repos":["facebookresearch/deepcluster"],"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/variational-wasserstein-clustering","slug":"variational-wasserstein-clustering","title":"Variational Wasserstein Clustering","date":"2018-06-23","arxiv_id":"1806.09045","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-wasserstein-clustering#ran","syntology_url":"https://syntology.ai/paper/1806.09045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09045"}},"official":{"repos":["icemiliang/vot"],"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/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/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","repositories_listed":2,"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":3,"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/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}},"official":null}},{"url":"/paper/mutual-information-maximization-for-simple","slug":"mutual-information-maximization-for-simple","title":"Mutual Information Maximization for Simple and Accurate Part-Of-Speech Induction","date":"2018-04-20","arxiv_id":"1804.07849","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/mutual-information-maximization-for-simple#ran","syntology_url":"https://syntology.ai/paper/1804.07849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07849"}},"official":{"repos":["karlstratos/mmi-tagger"],"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/mog-mapper-on-graphs-for-relationship","slug":"mog-mapper-on-graphs-for-relationship","title":"Homology-Preserving Multi-Scale Graph Skeletonization Using Mapper on Graphs","date":"2018-04-03","arxiv_id":"1804.11242","repositories_listed":3,"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/mog-mapper-on-graphs-for-relationship#ran","syntology_url":"https://syntology.ai/paper/1804.11242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.11242"}},"official":{"repos":["USFDataVisualization/MapperOnGraphs","shape-vis/mapperongraphs"],"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/a-high-bias-low-variance-introduction-to","slug":"a-high-bias-low-variance-introduction-to","title":"A high-bias, low-variance introduction to Machine Learning for physicists","date":"2018-03-23","arxiv_id":"1803.08823","repositories_listed":7,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-high-bias-low-variance-introduction-to#ran","syntology_url":"https://syntology.ai/paper/1803.08823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08823"}},"official":{"repos":["drckf/mlreview_notebooks","alexandreday/fast_density_clustering"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adversarial-generalized-method-of-moments","slug":"adversarial-generalized-method-of-moments","title":"Adversarial Generalized Method of Moments","date":"2018-03-19","arxiv_id":"1803.07164","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-generalized-method-of-moments#ran","syntology_url":"https://syntology.ai/paper/1803.07164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07164"}},"official":{"repos":["vsyrgkanis/adversarial_gmm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-object-detection-learning-to","slug":"zero-shot-object-detection-learning-to","title":"Zero-Shot Object Detection: Learning to Simultaneously Recognize and Localize Novel Concepts","date":"2018-03-16","arxiv_id":"1803.06049","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/zero-shot-object-detection-learning-to#ran","syntology_url":"https://syntology.ai/paper/1803.06049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06049"}},"official":null}},{"url":"/paper/local-spectral-graph-convolution-for-point","slug":"local-spectral-graph-convolution-for-point","title":"Local Spectral Graph Convolution for Point Set Feature Learning","date":"2018-03-15","arxiv_id":"1803.05827","repositories_listed":1,"syntology":{"n":18,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/local-spectral-graph-convolution-for-point#ran","syntology_url":"https://syntology.ai/paper/1803.05827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05827"}},"official":null}},{"url":"/paper/ordered-preference-elicitation-strategies-for","slug":"ordered-preference-elicitation-strategies-for","title":"Ordered Preference Elicitation Strategies for Supporting Multi-Objective Decision Making","date":"2018-02-21","arxiv_id":"1802.07606","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/ordered-preference-elicitation-strategies-for#ran","syntology_url":"https://syntology.ai/paper/1802.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07606"}},"official":{"repos":["lmzintgraf/gp_pref_elicit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-clustering-through-fairlets","slug":"fair-clustering-through-fairlets","title":"Fair Clustering Through Fairlets","date":"2018-02-15","arxiv_id":"1802.05733","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":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-clustering-through-fairlets#ran","syntology_url":"https://syntology.ai/paper/1802.05733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05733"}},"official":null}},{"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/the-information-bottleneck-and-geometric","slug":"the-information-bottleneck-and-geometric","title":"The information bottleneck and geometric clustering","date":"2017-12-27","arxiv_id":"1712.09657","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/the-information-bottleneck-and-geometric#ran","syntology_url":"https://syntology.ai/paper/1712.09657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09657"}},"official":{"repos":["djstrouse/information-bottleneck"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/binary-classification-from-positive","slug":"binary-classification-from-positive","title":"Binary Classification from Positive-Confidence Data","date":"2017-10-19","arxiv_id":"1710.07138","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/binary-classification-from-positive#ran","syntology_url":"https://syntology.ai/paper/1710.07138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.07138"}},"official":{"repos":["takashiishida/pconf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/squeezeseg-convolutional-neural-nets-with","slug":"squeezeseg-convolutional-neural-nets-with","title":"SqueezeSeg: Convolutional Neural Nets with Recurrent CRF for Real-Time Road-Object Segmentation from 3D LiDAR Point Cloud","date":"2017-10-19","arxiv_id":"1710.07368","repositories_listed":5,"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/squeezeseg-convolutional-neural-nets-with#ran","syntology_url":"https://syntology.ai/paper/1710.07368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.07368"}},"official":null}},{"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/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"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/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/sampling-matters-in-deep-embedding-learning","slug":"sampling-matters-in-deep-embedding-learning","title":"Sampling Matters in Deep Embedding Learning","date":"2017-06-23","arxiv_id":"1706.07567","repositories_listed":6,"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/sampling-matters-in-deep-embedding-learning#ran","syntology_url":"https://syntology.ai/paper/1706.07567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.07567"}},"official":null}},{"url":"/paper/deep-speaker-an-end-to-end-neural-speaker","slug":"deep-speaker-an-end-to-end-neural-speaker","title":"Deep Speaker: an End-to-End Neural Speaker Embedding System","date":"2017-05-05","arxiv_id":"1705.02304","repositories_listed":15,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"7 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-speaker-an-end-to-end-neural-speaker#ran","syntology_url":"https://syntology.ai/paper/1705.02304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02304"}},"official":null}},{"url":"/paper/an-embedded-segmental-k-means-model-for","slug":"an-embedded-segmental-k-means-model-for","title":"An embedded segmental K-means model for unsupervised segmentation and clustering of speech","date":"2017-03-23","arxiv_id":"1703.08135","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-embedded-segmental-k-means-model-for#ran","syntology_url":"https://syntology.ai/paper/1703.08135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.08135"}},"official":null}},{"url":"/paper/multi-talker-speech-separation-with-utterance","slug":"multi-talker-speech-separation-with-utterance","title":"Multi-talker Speech Separation with Utterance-level Permutation Invariant Training of Deep Recurrent Neural Networks","date":"2017-03-18","arxiv_id":"1703.06284","repositories_listed":3,"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/multi-talker-speech-separation-with-utterance#ran","syntology_url":"https://syntology.ai/paper/1703.06284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06284"}},"official":null}},{"url":"/paper/qcd-aware-recursive-neural-networks-for-jet","slug":"qcd-aware-recursive-neural-networks-for-jet","title":"QCD-Aware Recursive Neural Networks for Jet Physics","date":"2017-02-02","arxiv_id":"1702.00748","repositories_listed":6,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/qcd-aware-recursive-neural-networks-for-jet#ran","syntology_url":"https://syntology.ai/paper/1702.00748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.00748"}},"official":{"repos":["glouppe/recnn"],"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":["listed","official"]}}},{"url":"/paper/fast-exact-k-means-k-medians-and-bregman","slug":"fast-exact-k-means-k-medians-and-bregman","title":"Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D","date":"2017-01-25","arxiv_id":"1701.07204","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fast-exact-k-means-k-medians-and-bregman#ran","syntology_url":"https://syntology.ai/paper/1701.07204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.07204"}},"official":null}},{"url":"/paper/a-general-and-adaptive-robust-loss-function","slug":"a-general-and-adaptive-robust-loss-function","title":"A General and Adaptive Robust Loss Function","date":"2017-01-11","arxiv_id":"1701.03077","repositories_listed":3,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-general-and-adaptive-robust-loss-function#ran","syntology_url":"https://syntology.ai/paper/1701.03077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.03077"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"1cf93ae419205e0fcc905e9387e0c21604af51d8e2615030e34fd627d82a0940","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}