{"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/3","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":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/clustering/papers/ran/4","papers":[{"url":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ucsl-a-machine-learning-expectation","slug":"ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","arxiv_id":"2107.01988","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ucsl-a-machine-learning-expectation#ran","syntology_url":"https://syntology.ai/paper/2107.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01988"}},"official":{"repos":["neurospin-projects/2021_rlouiset_ucsl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/s2c2-an-orthogonal-method-for-semi-supervised","slug":"s2c2-an-orthogonal-method-for-semi-supervised","title":"A data-centric approach for improving ambiguous labels with combined semi-supervised classification and clustering","date":"2021-06-30","arxiv_id":"2106.16209","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/s2c2-an-orthogonal-method-for-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/2106.16209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16209"}},"official":{"repos":["emprime/dc3"],"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/a-clustering-based-framework-for-classifying","slug":"a-clustering-based-framework-for-classifying","title":"A Clustering-based Framework for Classifying Data Streams","date":"2021-06-22","arxiv_id":"2106.11823","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-clustering-based-framework-for-classifying#ran","syntology_url":"https://syntology.ai/paper/2106.11823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11823"}},"official":{"repos":["XuyangAbert/CDSC-AL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/multi-vae-learning-disentangled-view-common","slug":"multi-vae-learning-disentangled-view-common","title":"Multi-VAE: Learning Disentangled View-common and View-peculiar Visual Representations for Multi-view Clustering","date":"2021-06-21","arxiv_id":"2106.11232","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/multi-vae-learning-disentangled-view-common#ran","syntology_url":"https://syntology.ai/paper/2106.11232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11232"}},"official":null}},{"url":"/paper/neighborhood-contrastive-learning-for-novel","slug":"neighborhood-contrastive-learning-for-novel","title":"Neighborhood Contrastive Learning for Novel Class Discovery","date":"2021-06-20","arxiv_id":"2106.10731","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/neighborhood-contrastive-learning-for-novel#ran","syntology_url":"https://syntology.ai/paper/2106.10731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10731"}},"official":{"repos":["zhunzhong07/NCL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-correlation-based-multiview-learning","slug":"latent-correlation-based-multiview-learning","title":"Understanding Latent Correlation-Based Multiview Learning and Self-Supervision: An Identifiability Perspective","date":"2021-06-14","arxiv_id":"2106.07115","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-correlation-based-multiview-learning#ran","syntology_url":"https://syntology.ai/paper/2106.07115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07115"}},"official":null}},{"url":"/paper/hubert-self-supervised-speech-representation","slug":"hubert-self-supervised-speech-representation","title":"HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units","date":"2021-06-14","arxiv_id":"2106.07447","repositories_listed":11,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/hubert-self-supervised-speech-representation#ran","syntology_url":"https://syntology.ai/paper/2106.07447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07447"}},"official":{"repos":["pytorch/fairseq","huggingface/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/deep-clustering-based-fair-outlier-detection","slug":"deep-clustering-based-fair-outlier-detection","title":"Deep Clustering based Fair Outlier Detection","date":"2021-06-09","arxiv_id":"2106.05127","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-clustering-based-fair-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2106.05127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05127"}},"official":{"repos":["brandeis-machine-learning/FairOutlierDetection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-facet-clustering-variational","slug":"multi-facet-clustering-variational","title":"Multi-Facet Clustering Variational Autoencoders","date":"2021-06-09","arxiv_id":"2106.05241","repositories_listed":1,"syntology":{"n":25,"n_ran":14,"n_constructed":1,"n_ran_checked":8,"n_instrument":6,"n_unverified":11,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":4,"phrase":"14 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/multi-facet-clustering-variational#ran","syntology_url":"https://syntology.ai/paper/2106.05241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05241"}},"official":{"repos":["FabianFalck/mfcvae"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/local-algorithms-for-finding-densely","slug":"local-algorithms-for-finding-densely","title":"Local Algorithms for Finding Densely Connected Clusters","date":"2021-06-09","arxiv_id":"2106.05245","repositories_listed":1,"syntology":{"n":15,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/local-algorithms-for-finding-densely#ran","syntology_url":"https://syntology.ai/paper/2106.05245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05245"}},"official":{"repos":["pmacg/local-densely-connected-clusters"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/a-new-notion-of-individually-fair-clustering","slug":"a-new-notion-of-individually-fair-clustering","title":"A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center","date":"2021-06-09","arxiv_id":"2106.05423","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-new-notion-of-individually-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/2106.05423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05423"}},"official":{"repos":["chakrabarti/equitable_clustering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-learning-for-cuboid-shape","slug":"unsupervised-learning-for-cuboid-shape","title":"Unsupervised Learning for Cuboid Shape Abstraction via Joint Segmentation from Point Clouds","date":"2021-06-07","arxiv_id":"2106.03437","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/unsupervised-learning-for-cuboid-shape#ran","syntology_url":"https://syntology.ai/paper/2106.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03437"}},"official":null}},{"url":"/paper/unsupervised-representation-learning-for-time-1","slug":"unsupervised-representation-learning-for-time-1","title":"Unsupervised Representation Learning for Time Series with Temporal Neighborhood Coding","date":"2021-06-01","arxiv_id":"2106.00750","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-representation-learning-for-time-1#ran","syntology_url":"https://syntology.ai/paper/2106.00750","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00750"}},"official":{"repos":["sanatonek/TNC_representation_learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-activity-segmentation-by-joint","slug":"unsupervised-activity-segmentation-by-joint","title":"Unsupervised Action Segmentation by Joint Representation Learning and Online Clustering","date":"2021-05-27","arxiv_id":"2105.13353","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/unsupervised-activity-segmentation-by-joint#ran","syntology_url":"https://syntology.ai/paper/2105.13353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13353"}},"official":{"repos":["trquhuytin/TOT-CVPR22"],"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/xomivae-an-interpretable-deep-learning-model","slug":"xomivae-an-interpretable-deep-learning-model","title":"XOmiVAE: an interpretable deep learning model for cancer classification using high-dimensional omics data","date":"2021-05-26","arxiv_id":"2105.12807","repositories_listed":2,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/xomivae-an-interpretable-deep-learning-model#ran","syntology_url":"https://syntology.ai/paper/2105.12807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12807"}},"official":{"repos":["zhangxiaoyu11/XOmiVAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-visual-representation-learning-3","slug":"unsupervised-visual-representation-learning-3","title":"Unsupervised Visual Representation Learning by Online Constrained K-Means","date":"2021-05-24","arxiv_id":"2105.11527","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-visual-representation-learning-3#ran","syntology_url":"https://syntology.ai/paper/2105.11527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11527"}},"official":{"repos":["idstcv/coke"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mean-shift-for-self-supervised-learning","slug":"mean-shift-for-self-supervised-learning","title":"Mean Shift for Self-Supervised Learning","date":"2021-05-15","arxiv_id":"2105.07269","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/mean-shift-for-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2105.07269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.07269"}},"official":{"repos":["UMBCvision/MSF"],"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/towards-discovery-and-attribution-of-open","slug":"towards-discovery-and-attribution-of-open","title":"Towards Discovery and Attribution of Open-world GAN Generated Images","date":"2021-05-10","arxiv_id":"2105.04580","repositories_listed":1,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-discovery-and-attribution-of-open#ran","syntology_url":"https://syntology.ai/paper/2105.04580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04580"}},"official":{"repos":["Sharath-girish/openworld-gan"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/provable-guarantees-against-data-poisoning","slug":"provable-guarantees-against-data-poisoning","title":"Incompatibility Clustering as a Defense Against Backdoor Poisoning Attacks","date":"2021-05-08","arxiv_id":"2105.03692","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/provable-guarantees-against-data-poisoning#ran","syntology_url":"https://syntology.ai/paper/2105.03692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03692"}},"official":{"repos":["charlesjin/compatibility_clustering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mice-mixture-of-contrastive-experts-for-1","slug":"mice-mixture-of-contrastive-experts-for-1","title":"MiCE: Mixture of Contrastive Experts for Unsupervised Image Clustering","date":"2021-05-05","arxiv_id":"2105.01899","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mice-mixture-of-contrastive-experts-for-1#ran","syntology_url":"https://syntology.ai/paper/2105.01899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01899"}},"official":{"repos":["TsungWeiTsai/MiCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-for-clustering-via","slug":"representation-learning-for-clustering-via","title":"Representation Learning for Clustering via Building Consensus","date":"2021-05-04","arxiv_id":"2105.01289","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/representation-learning-for-clustering-via#ran","syntology_url":"https://syntology.ai/paper/2105.01289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01289"}},"official":{"repos":["JayanthRR/ConCURL_NCE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/powered-dirichlet-process-for-controlling-the","slug":"powered-dirichlet-process-for-controlling-the","title":"Powered Dirichlet Process for Controlling the Importance of \"Rich-Get-Richer\" Prior Assumptions in Bayesian Clustering","date":"2021-04-26","arxiv_id":"2104.12485","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/powered-dirichlet-process-for-controlling-the#ran","syntology_url":"https://syntology.ai/paper/2104.12485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12485"}},"official":{"repos":["GaelPouxMedard/PDP"],"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/multimodal-clustering-networks-for-self","slug":"multimodal-clustering-networks-for-self","title":"Multimodal Clustering Networks for Self-supervised Learning from Unlabeled Videos","date":"2021-04-26","arxiv_id":"2104.12671","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/multimodal-clustering-networks-for-self#ran","syntology_url":"https://syntology.ai/paper/2104.12671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12671"}},"official":{"repos":["brian7685/Multimodal-Clustering-Network"],"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/cross-domain-adaptive-clustering-for-semi","slug":"cross-domain-adaptive-clustering-for-semi","title":"Cross-Domain Adaptive Clustering for Semi-Supervised Domain Adaptation","date":"2021-04-19","arxiv_id":"2104.09415","repositories_listed":3,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cross-domain-adaptive-clustering-for-semi#ran","syntology_url":"https://syntology.ai/paper/2104.09415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09415"}},"official":{"repos":["lijichang/CVPR2021-SSDA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/higher-order-attribute-enhancing","slug":"higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07892","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/higher-order-attribute-enhancing#ran","syntology_url":"https://syntology.ai/paper/2104.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07892"}},"official":{"repos":["RingBDStack/HAE"],"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/does-language-help-generalization-in-vision","slug":"does-language-help-generalization-in-vision","title":"Does language help generalization in vision models?","date":"2021-04-16","arxiv_id":"2104.08313","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-language-help-generalization-in-vision#ran","syntology_url":"https://syntology.ai/paper/2104.08313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08313"}},"official":{"repos":["bdvllrs/generalization-vision"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-contrastive-clustering","slug":"graph-contrastive-clustering","title":"Graph Contrastive Clustering","date":"2021-04-03","arxiv_id":"2104.01429","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-contrastive-clustering#ran","syntology_url":"https://syntology.ai/paper/2104.01429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01429"}},"official":null}},{"url":"/paper/picie-unsupervised-semantic-segmentation","slug":"picie-unsupervised-semantic-segmentation","title":"PiCIE: Unsupervised Semantic Segmentation using Invariance and Equivariance in Clustering","date":"2021-03-30","arxiv_id":"2103.17070","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/picie-unsupervised-semantic-segmentation#ran","syntology_url":"https://syntology.ai/paper/2103.17070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.17070"}},"official":{"repos":["janghyuncho/PiCIE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/panoptic-polarnet-proposal-free-lidar-point","slug":"panoptic-polarnet-proposal-free-lidar-point","title":"Panoptic-PolarNet: Proposal-free LiDAR Point Cloud Panoptic Segmentation","date":"2021-03-27","arxiv_id":"2103.14962","repositories_listed":2,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":8,"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, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/panoptic-polarnet-proposal-free-lidar-point#ran","syntology_url":"https://syntology.ai/paper/2103.14962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.14962"}},"official":{"repos":["edwardzhou130/Panoptic-PolarNet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/progressive-x-clustering-in-the-consensus","slug":"progressive-x-clustering-in-the-consensus","title":"Finding Geometric Models by Clustering in the Consensus Space","date":"2021-03-25","arxiv_id":"2103.13875","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/progressive-x-clustering-in-the-consensus#ran","syntology_url":"https://syntology.ai/paper/2103.13875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13875"}},"official":{"repos":["danini/clustering-in-consensus-space"],"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/supporting-clustering-with-contrastive","slug":"supporting-clustering-with-contrastive","title":"Supporting Clustering with Contrastive Learning","date":"2021-03-24","arxiv_id":"2103.12953","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/supporting-clustering-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2103.12953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12953"}},"official":{"repos":["amazon-research/sccl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-face-clustering-on-a-large","slug":"structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","arxiv_id":"2103.13225","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structure-aware-face-clustering-on-a-large#ran","syntology_url":"https://syntology.ai/paper/2103.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13225"}},"official":{"repos":["sstzal/STAR-FC"],"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/group-aware-label-transfer-for-domain","slug":"group-aware-label-transfer-for-domain","title":"Group-aware Label Transfer for Domain Adaptive Person Re-identification","date":"2021-03-23","arxiv_id":"2103.12366","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/group-aware-label-transfer-for-domain#ran","syntology_url":"https://syntology.ai/paper/2103.12366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12366"}},"official":{"repos":["zkcys001/UDAStrongBaseline"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-contrast-for-unsupervised-person-re","slug":"cluster-contrast-for-unsupervised-person-re","title":"Cluster Contrast for Unsupervised Person Re-Identification","date":"2021-03-22","arxiv_id":"2103.11568","repositories_listed":4,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/cluster-contrast-for-unsupervised-person-re#ran","syntology_url":"https://syntology.ai/paper/2103.11568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11568"}},"official":{"repos":["alibaba/cluster-contrast","wangguangyuan/ClusterContrast"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/temporally-weighted-hierarchical-clustering","slug":"temporally-weighted-hierarchical-clustering","title":"Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation","date":"2021-03-20","arxiv_id":"2103.11264","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/temporally-weighted-hierarchical-clustering#ran","syntology_url":"https://syntology.ai/paper/2103.11264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11264"}},"official":{"repos":["ssarfraz/FINCH-CLustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/three-steps-to-multimodal-trajectory","slug":"three-steps-to-multimodal-trajectory","title":"Three Steps to Multimodal Trajectory Prediction: Modality Clustering, Classification and Synthesis","date":"2021-03-14","arxiv_id":"2103.07854","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/three-steps-to-multimodal-trajectory#ran","syntology_url":"https://syntology.ai/paper/2103.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07854"}},"official":null}},{"url":"/paper/learning-a-proposal-classifier-for-multiple","slug":"learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","arxiv_id":"2103.07889","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"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 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-a-proposal-classifier-for-multiple#ran","syntology_url":"https://syntology.ai/paper/2103.07889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07889"}},"official":{"repos":["daip13/LPC_MOT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/magface-a-universal-representation-for-face","slug":"magface-a-universal-representation-for-face","title":"MagFace: A Universal Representation for Face Recognition and Quality Assessment","date":"2021-03-11","arxiv_id":"2103.06627","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/magface-a-universal-representation-for-face#ran","syntology_url":"https://syntology.ai/paper/2103.06627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06627"}},"official":{"repos":["IrvingMeng/MagFace"],"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/novelty-detection-in-sequential-data-by","slug":"novelty-detection-in-sequential-data-by","title":"Novelty Detection in Sequential Data by Informed Clustering and Modeling","date":"2021-03-05","arxiv_id":"2103.03943","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/novelty-detection-in-sequential-data-by#ran","syntology_url":"https://syntology.ai/paper/2103.03943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03943"}},"official":{"repos":["kampmichael/noveltydetectionsequentialdata"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-semantic-segmentation-by","slug":"unsupervised-semantic-segmentation-by","title":"Unsupervised Semantic Segmentation by Contrasting Object Mask Proposals","date":"2021-02-11","arxiv_id":"2102.06191","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/unsupervised-semantic-segmentation-by#ran","syntology_url":"https://syntology.ai/paper/2102.06191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06191"}},"official":{"repos":["wvangansbeke/Unsupervised-Semantic-Segmentation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/eigengame-unloaded-when-playing-games-is","slug":"eigengame-unloaded-when-playing-games-is","title":"EigenGame Unloaded: When playing games is better than optimizing","date":"2021-02-08","arxiv_id":"2102.04152","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/eigengame-unloaded-when-playing-games-is#ran","syntology_url":"https://syntology.ai/paper/2102.04152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04152"}},"official":null}},{"url":"/paper/graph-neural-network-to-dilute-outliers-for","slug":"graph-neural-network-to-dilute-outliers-for","title":"Graph Neural Network to Dilute Outliers for Refactoring Monolith Application","date":"2021-02-07","arxiv_id":"2102.03827","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/graph-neural-network-to-dilute-outliers-for#ran","syntology_url":"https://syntology.ai/paper/2102.03827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03827"}},"official":{"repos":["utkd/cogcn"],"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/maximum-entropy-subspace-clustering-network","slug":"maximum-entropy-subspace-clustering-network","title":"Maximum Entropy Subspace Clustering Network","date":"2020-12-06","arxiv_id":"2012.03176","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/maximum-entropy-subspace-clustering-network#ran","syntology_url":"https://syntology.ai/paper/2012.03176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.03176"}},"official":{"repos":["ZhihaoPENG-CityU/MESC"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/persistent-mixture-model-networks-for-few","slug":"persistent-mixture-model-networks-for-few","title":"Mixture-based Feature Space Learning for Few-shot Image Classification","date":"2020-11-24","arxiv_id":"2011.11872","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/persistent-mixture-model-networks-for-few#ran","syntology_url":"https://syntology.ai/paper/2011.11872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11872"}},"official":null}},{"url":"/paper/lidar-based-panoptic-segmentation-via-dynamic","slug":"lidar-based-panoptic-segmentation-via-dynamic","title":"LiDAR-based Panoptic Segmentation via Dynamic Shifting Network","date":"2020-11-24","arxiv_id":"2011.11964","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/lidar-based-panoptic-segmentation-via-dynamic#ran","syntology_url":"https://syntology.ai/paper/2011.11964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11964"}},"official":{"repos":["hongfz16/DS-Net"],"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/the-zero-resource-speech-benchmark-2021","slug":"the-zero-resource-speech-benchmark-2021","title":"The Zero Resource Speech Benchmark 2021: Metrics and baselines for unsupervised spoken language modeling","date":"2020-11-23","arxiv_id":"2011.11588","repositories_listed":2,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-zero-resource-speech-benchmark-2021#ran","syntology_url":"https://syntology.ai/paper/2011.11588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11588"}},"official":{"repos":["bootphon/zerospeech2021_baseline"],"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/attentive-clustering-processes","slug":"attentive-clustering-processes","title":"Amortized Probabilistic Detection of Communities in Graphs","date":"2020-10-29","arxiv_id":"2010.15727","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attentive-clustering-processes#ran","syntology_url":"https://syntology.ai/paper/2010.15727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.15727"}},"official":{"repos":["aripakman/amortized_community_detection","aripakman/attentive_clustering_processes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/trajectory-wise-multiple-choice-learning-for","slug":"trajectory-wise-multiple-choice-learning-for","title":"Trajectory-wise Multiple Choice Learning for Dynamics Generalization in Reinforcement Learning","date":"2020-10-26","arxiv_id":"2010.13303","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trajectory-wise-multiple-choice-learning-for#ran","syntology_url":"https://syntology.ai/paper/2010.13303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13303"}},"official":{"repos":["younggyoseo/trajectory_mcl"],"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/backdoor-attack-against-speaker-verification","slug":"backdoor-attack-against-speaker-verification","title":"Backdoor Attack against Speaker Verification","date":"2020-10-22","arxiv_id":"2010.11607","repositories_listed":2,"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/backdoor-attack-against-speaker-verification#ran","syntology_url":"https://syntology.ai/paper/2010.11607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11607"}},"official":{"repos":["zhaitongqing233/Backdoor-attack-against-speaker-verification"],"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/scalable-bottom-up-hierarchical-clustering","slug":"scalable-bottom-up-hierarchical-clustering","title":"Scalable Hierarchical Agglomerative Clustering","date":"2020-10-22","arxiv_id":"2010.11821","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-bottom-up-hierarchical-clustering#ran","syntology_url":"https://syntology.ai/paper/2010.11821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11821"}},"official":{"repos":["nmonath/scc"],"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/active-domain-adaptation-via-clustering","slug":"active-domain-adaptation-via-clustering","title":"Active Domain Adaptation via Clustering Uncertainty-weighted Embeddings","date":"2020-10-16","arxiv_id":"2010.08666","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/active-domain-adaptation-via-clustering#ran","syntology_url":"https://syntology.ai/paper/2010.08666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08666"}},"official":{"repos":["virajprabhu/clue"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/smyrf-efficient-attention-using-asymmetric","slug":"smyrf-efficient-attention-using-asymmetric","title":"SMYRF: Efficient Attention using Asymmetric Clustering","date":"2020-10-11","arxiv_id":"2010.05315","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/smyrf-efficient-attention-using-asymmetric#ran","syntology_url":"https://syntology.ai/paper/2010.05315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05315"}},"official":{"repos":["giannisdaras/smyrf"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/deep-clustering-and-representation-learning","slug":"deep-clustering-and-representation-learning","title":"Generalized Clustering and Multi-Manifold Learning with Geometric Structure Preservation","date":"2020-09-21","arxiv_id":"2009.09590","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-clustering-and-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2009.09590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09590"}},"official":{"repos":["lirongwu/gcml"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-clustering","slug":"contrastive-clustering","title":"Contrastive Clustering","date":"2020-09-21","arxiv_id":"2009.09687","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-clustering#ran","syntology_url":"https://syntology.ai/paper/2009.09687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09687"}},"official":{"repos":["Yunfan-Li/Contrastive-Clustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/few-shot-unsupervised-continual-learning","slug":"few-shot-unsupervised-continual-learning","title":"Few-Shot Unsupervised Continual Learning through Meta-Examples","date":"2020-09-17","arxiv_id":"2009.08107","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":1,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 1 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) · 2 unverified","sample_list":"/paper/few-shot-unsupervised-continual-learning#ran","syntology_url":"https://syntology.ai/paper/2009.08107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08107"}},"official":{"repos":["alessiabertugli/FUSION"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}},"official":null}},{"url":"/paper/self-supervised-learning-for-large-scale","slug":"self-supervised-learning-for-large-scale","title":"Self-Supervised Learning for Large-Scale Unsupervised Image Clustering","date":"2020-08-24","arxiv_id":"2008.10312","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/self-supervised-learning-for-large-scale#ran","syntology_url":"https://syntology.ai/paper/2008.10312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10312"}},"official":{"repos":["Randl/kmeans_selfsuper"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/weakly-supervised-semantic-segmentation-via-1","slug":"weakly-supervised-semantic-segmentation-via-1","title":"Weakly-Supervised Semantic Segmentation via Sub-category Exploration","date":"2020-08-03","arxiv_id":"2008.01183","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/weakly-supervised-semantic-segmentation-via-1#ran","syntology_url":"https://syntology.ai/paper/2008.01183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.01183"}},"official":{"repos":["Juliachang/SC-CAM"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/music-fadernets-controllable-music-generation","slug":"music-fadernets-controllable-music-generation","title":"Music FaderNets: Controllable Music Generation Based On High-Level Features via Low-Level Feature Modelling","date":"2020-07-29","arxiv_id":"2007.15474","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/music-fadernets-controllable-music-generation#ran","syntology_url":"https://syntology.ai/paper/2007.15474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15474"}},"official":{"repos":["gudgud96/music-fader-nets"],"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/identity-guided-human-semantic-parsing-for","slug":"identity-guided-human-semantic-parsing-for","title":"Identity-Guided Human Semantic Parsing for Person Re-Identification","date":"2020-07-27","arxiv_id":"2007.13467","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/identity-guided-human-semantic-parsing-for#ran","syntology_url":"https://syntology.ai/paper/2007.13467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13467"}},"official":{"repos":["CASIA-IVA-Lab/ISP-reID"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-topology-inference-benchmarks-for","slug":"graph-topology-inference-benchmarks-for","title":"Graph topology inference benchmarks for machine learning","date":"2020-07-16","arxiv_id":"2007.08216","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-topology-inference-benchmarks-for#ran","syntology_url":"https://syntology.ai/paper/2007.08216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08216"}},"official":{"repos":["cadurosar/benchmark_graphinference"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/featmatch-feature-based-augmentation-for-semi","slug":"featmatch-feature-based-augmentation-for-semi","title":"FeatMatch: Feature-Based Augmentation for Semi-Supervised Learning","date":"2020-07-16","arxiv_id":"2007.08505","repositories_listed":2,"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/featmatch-feature-based-augmentation-for-semi#ran","syntology_url":"https://syntology.ai/paper/2007.08505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08505"}},"official":null}},{"url":"/paper/graph-structure-of-neural-networks","slug":"graph-structure-of-neural-networks","title":"Graph Structure of Neural Networks","date":"2020-07-13","arxiv_id":"2007.06559","repositories_listed":3,"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":6,"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/graph-structure-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.06559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06559"}},"official":{"repos":["facebookresearch/graph2nn"],"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/let-the-data-choose-its-features","slug":"let-the-data-choose-its-features","title":"Differentiable Unsupervised Feature Selection based on a Gated Laplacian","date":"2020-07-09","arxiv_id":"2007.04728","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/let-the-data-choose-its-features#ran","syntology_url":"https://syntology.ai/paper/2007.04728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04728"}},"official":{"repos":["Ofirlin/DUFS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-graph-encoder-for-attributed-graph","slug":"adaptive-graph-encoder-for-attributed-graph","title":"Adaptive Graph Encoder for Attributed Graph Embedding","date":"2020-07-03","arxiv_id":"2007.01594","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/adaptive-graph-encoder-for-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2007.01594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01594"}},"official":{"repos":["thunlp/AGE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/laplacian-regularized-few-shot-learning-1","slug":"laplacian-regularized-few-shot-learning-1","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-28","arxiv_id":"2006.15486","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/laplacian-regularized-few-shot-learning-1#ran","syntology_url":"https://syntology.ai/paper/2006.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15486"}},"official":{"repos":["imtiazziko/LaplacianShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unsupervised-learning-of-video-1","slug":"unsupervised-learning-of-video-1","title":"Unsupervised Learning of Video Representations via Dense Trajectory Clustering","date":"2020-06-28","arxiv_id":"2006.15731","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-learning-of-video-1#ran","syntology_url":"https://syntology.ai/paper/2006.15731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15731"}},"official":{"repos":["pvtokmakov/video_cluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/labelling-unlabelled-videos-from-scratch-with","slug":"labelling-unlabelled-videos-from-scratch-with","title":"Labelling unlabelled videos from scratch with multi-modal self-supervision","date":"2020-06-24","arxiv_id":"2006.13662","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":5,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/labelling-unlabelled-videos-from-scratch-with#ran","syntology_url":"https://syntology.ai/paper/2006.13662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13662"}},"official":{"repos":["facebookresearch/selavi"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-network-based-coarse-grained","slug":"graph-neural-network-based-coarse-grained","title":"Graph Neural Network Based Coarse-Grained Mapping Prediction","date":"2020-06-24","arxiv_id":"2007.04921","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-neural-network-based-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2007.04921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04921"}},"official":{"repos":["rochesterxugroup/DSGPM","rochesterxugroup/HAM_dataset"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/distributional-individual-fairness-in","slug":"distributional-individual-fairness-in","title":"Distributional Individual Fairness in Clustering","date":"2020-06-22","arxiv_id":"2006.12589","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distributional-individual-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2006.12589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12589"}},"official":{"repos":["nihesh/distributional_individual_fairness_in_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-transformation-invariant-clustering","slug":"deep-transformation-invariant-clustering","title":"Deep Transformation-Invariant Clustering","date":"2020-06-19","arxiv_id":"2006.11132","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-transformation-invariant-clustering#ran","syntology_url":"https://syntology.ai/paper/2006.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11132"}},"official":{"repos":["monniert/dti-clustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/diverse-image-generation-via-self-conditioned-1","slug":"diverse-image-generation-via-self-conditioned-1","title":"Diverse Image Generation via Self-Conditioned GANs","date":"2020-06-18","arxiv_id":"2006.10728","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diverse-image-generation-via-self-conditioned-1#ran","syntology_url":"https://syntology.ai/paper/2006.10728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10728"}},"official":{"repos":["stevliu/self-conditioned-gan"],"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/improving-few-shot-visual-classification-with","slug":"improving-few-shot-visual-classification-with","title":"Enhancing Few-Shot Image Classification with Unlabelled Examples","date":"2020-06-17","arxiv_id":"2006.12245","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-few-shot-visual-classification-with#ran","syntology_url":"https://syntology.ai/paper/2006.12245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12245"}},"official":{"repos":["plai-group/simple-cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-diverse-and-discriminative","slug":"learning-diverse-and-discriminative","title":"Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction","date":"2020-06-15","arxiv_id":"2006.08558","repositories_listed":2,"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":2,"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/learning-diverse-and-discriminative#ran","syntology_url":"https://syntology.ai/paper/2006.08558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08558"}},"official":{"repos":["ryanchankh/mcr2"],"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/uncovering-the-topology-of-time-varying-fmri","slug":"uncovering-the-topology-of-time-varying-fmri","title":"Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence","date":"2020-06-14","arxiv_id":"2006.07882","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/uncovering-the-topology-of-time-varying-fmri#ran","syntology_url":"https://syntology.ai/paper/2006.07882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07882"}},"official":{"repos":["BorgwardtLab/fMRI_Cubical_Persistence"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clusttr-clustering-training-for-robustness","slug":"clusttr-clustering-training-for-robustness","title":"Rethinking Clustering for Robustness","date":"2020-06-13","arxiv_id":"2006.07682","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clusttr-clustering-training-for-robustness#ran","syntology_url":"https://syntology.ai/paper/2006.07682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07682"}},"official":{"repos":["clustr-official-account/ClusTR-Clustering-Training-For-Robustness"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unmasking-the-inductive-biases-of","slug":"unmasking-the-inductive-biases-of","title":"Benchmarking Unsupervised Object Representations for Video Sequences","date":"2020-06-12","arxiv_id":"2006.07034","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/unmasking-the-inductive-biases-of#ran","syntology_url":"https://syntology.ai/paper/2006.07034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07034"}},"official":{"repos":["ecker-lab/object-centric-representation-benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attentive-waveblock-complementarity-enhanced","slug":"attentive-waveblock-complementarity-enhanced","title":"Attentive WaveBlock: Complementarity-enhanced Mutual Networks for Unsupervised Domain Adaptation in Person Re-identification and Beyond","date":"2020-06-11","arxiv_id":"2006.06525","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/attentive-waveblock-complementarity-enhanced#ran","syntology_url":"https://syntology.ai/paper/2006.06525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06525"}},"official":{"repos":["WangWenhao0716/Attentive-WaveBlock"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-framework-for-clustered","slug":"an-efficient-framework-for-clustered","title":"An Efficient Framework for Clustered Federated Learning","date":"2020-06-07","arxiv_id":"2006.04088","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-efficient-framework-for-clustered#ran","syntology_url":"https://syntology.ai/paper/2006.04088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04088"}},"official":{"repos":["jichan3751/ifca"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/declutr-deep-contrastive-learning-for","slug":"declutr-deep-contrastive-learning-for","title":"DeCLUTR: Deep Contrastive Learning for Unsupervised Textual Representations","date":"2020-06-05","arxiv_id":"2006.03659","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/declutr-deep-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2006.03659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03659"}},"official":{"repos":["JohnGiorgi/DeCLUTR"],"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/self-paced-contrastive-learning-with-hybrid","slug":"self-paced-contrastive-learning-with-hybrid","title":"Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-ID","date":"2020-06-04","arxiv_id":"2006.02713","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-paced-contrastive-learning-with-hybrid#ran","syntology_url":"https://syntology.ai/paper/2006.02713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02713"}},"official":{"repos":["yxgeee/SpCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fuzzy-c-means-clustering-for-persistence","slug":"fuzzy-c-means-clustering-for-persistence","title":"Fuzzy c-Means Clustering for Persistence Diagrams","date":"2020-06-04","arxiv_id":"2006.02796","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuzzy-c-means-clustering-for-persistence#ran","syntology_url":"https://syntology.ai/paper/2006.02796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02796"}},"official":{"repos":["tomogwen/fpdcluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exkmc-expanding-explainable-k-means","slug":"exkmc-expanding-explainable-k-means","title":"ExKMC: Expanding Explainable $k$-Means Clustering","date":"2020-06-03","arxiv_id":"2006.02399","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":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exkmc-expanding-explainable-k-means#ran","syntology_url":"https://syntology.ai/paper/2006.02399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02399"}},"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/esam-discriminative-domain-adaptation-with","slug":"esam-discriminative-domain-adaptation-with","title":"ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performance","date":"2020-05-21","arxiv_id":"2005.10545","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/esam-discriminative-domain-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/2005.10545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10545"}},"official":{"repos":["A-bone1/ESAM"],"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/p-norm-flow-diffusion-for-local-graph","slug":"p-norm-flow-diffusion-for-local-graph","title":"$p$-Norm Flow Diffusion for Local Graph Clustering","date":"2020-05-20","arxiv_id":"2005.09810","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/p-norm-flow-diffusion-for-local-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09810"}},"official":{"repos":["s-h-yang/pNormFlowDiffusion"],"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/end-to-end-speaker-diarization-for-an-unknown","slug":"end-to-end-speaker-diarization-for-an-unknown","title":"End-to-End Speaker Diarization for an Unknown Number of Speakers with Encoder-Decoder Based Attractors","date":"2020-05-20","arxiv_id":"2005.09921","repositories_listed":3,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-speaker-diarization-for-an-unknown#ran","syntology_url":"https://syntology.ai/paper/2005.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09921"}},"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/robust-training-of-vector-quantized","slug":"robust-training-of-vector-quantized","title":"Robust Training of Vector Quantized Bottleneck Models","date":"2020-05-18","arxiv_id":"2005.08520","repositories_listed":1,"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/robust-training-of-vector-quantized#ran","syntology_url":"https://syntology.ai/paper/2005.08520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08520"}},"official":{"repos":["distsup/DistSup"],"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/stable-and-consistent-density-based","slug":"stable-and-consistent-density-based","title":"Stable and consistent density-based clustering via multiparameter persistence","date":"2020-05-18","arxiv_id":"2005.09048","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/stable-and-consistent-density-based#ran","syntology_url":"https://syntology.ai/paper/2005.09048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09048"}},"official":{"repos":["LuisScoccola/persistable"],"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/simple-scalable-and-stable-variational-deep","slug":"simple-scalable-and-stable-variational-deep","title":"Simple, Scalable, and Stable Variational Deep Clustering","date":"2020-05-16","arxiv_id":"2005.08047","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/simple-scalable-and-stable-variational-deep#ran","syntology_url":"https://syntology.ai/paper/2005.08047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08047"}},"official":{"repos":["king/s3vdc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/prototypical-contrastive-learning-of","slug":"prototypical-contrastive-learning-of","title":"Prototypical Contrastive Learning of Unsupervised Representations","date":"2020-05-11","arxiv_id":"2005.04966","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/prototypical-contrastive-learning-of#ran","syntology_url":"https://syntology.ai/paper/2005.04966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04966"}},"official":{"repos":["salesforce/PCL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-geometric-factors-in-model-learning","slug":"enhancing-geometric-factors-in-model-learning","title":"Enhancing Geometric Factors in Model Learning and Inference for Object Detection and Instance Segmentation","date":"2020-05-07","arxiv_id":"2005.03572","repositories_listed":6,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/enhancing-geometric-factors-in-model-learning#ran","syntology_url":"https://syntology.ai/paper/2005.03572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03572"}},"official":{"repos":["Zzh-tju/CIoU"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/morphocluster-efficient-annotation-of","slug":"morphocluster-efficient-annotation-of","title":"MorphoCluster: Efficient Annotation of Plankton images by Clustering","date":"2020-05-04","arxiv_id":"2005.01595","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/morphocluster-efficient-annotation-of#ran","syntology_url":"https://syntology.ai/paper/2005.01595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01595"}},"official":null}},{"url":"/paper/multi-center-federated-learning","slug":"multi-center-federated-learning","title":"Multi-Center Federated Learning: Clients Clustering for Better Personalization","date":"2020-05-03","arxiv_id":"2005.01026","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-center-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2005.01026","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01026"}},"official":{"repos":["mingxuts/multi-center-fed-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tired-of-topic-models-clusters-of-pretrained","slug":"tired-of-topic-models-clusters-of-pretrained","title":"Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!","date":"2020-04-30","arxiv_id":"2004.14914","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tired-of-topic-models-clusters-of-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14914"}},"official":{"repos":["adalmia96/Cluster-Analysis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-linguistic-typology-and-multilingual","slug":"bridging-linguistic-typology-and-multilingual","title":"Bridging Linguistic Typology and Multilingual Machine Translation with Multi-View Language Representations","date":"2020-04-30","arxiv_id":"2004.14923","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bridging-linguistic-typology-and-multilingual#ran","syntology_url":"https://syntology.ai/paper/2004.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14923"}},"official":{"repos":["aoncevay/multiview-langrep"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-embeddings-for-speaker","slug":"probabilistic-embeddings-for-speaker","title":"Probabilistic embeddings for speaker diarization","date":"2020-04-06","arxiv_id":"2004.04096","repositories_listed":1,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/probabilistic-embeddings-for-speaker#ran","syntology_url":"https://syntology.ai/paper/2004.04096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04096"}},"official":{"repos":["bsxfan/probabilistic_embeddings"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":19,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pointgroup-dual-set-point-grouping-for-3d","slug":"pointgroup-dual-set-point-grouping-for-3d","title":"PointGroup: Dual-Set Point Grouping for 3D Instance Segmentation","date":"2020-04-03","arxiv_id":"2004.01658","repositories_listed":4,"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/pointgroup-dual-set-point-grouping-for-3d#ran","syntology_url":"https://syntology.ai/paper/2004.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01658"}},"official":null}},{"url":"/paper/learning-to-cluster-faces-via-confidence-and","slug":"learning-to-cluster-faces-via-confidence-and","title":"Learning to Cluster Faces via Confidence and Connectivity Estimation","date":"2020-04-01","arxiv_id":"2004.00445","repositories_listed":3,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-cluster-faces-via-confidence-and#ran","syntology_url":"https://syntology.ai/paper/2004.00445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00445"}},"official":{"repos":["yl-1993/learn-to-cluster"],"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"]}}}],"record_sha256":"37e755bc529ea8027db3f8ae943627f8c86e154cb7d3514adf8b45517db357c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}