{"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/representation-learning/papers/3","list_of":"/task/representation-learning","task":"Representation Learning","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":106,"rows_per_page":100,"rows":[201,300],"of":10580,"counts":{"archive_papers_tagged":10580,"with_a_code_link":4662,"where_syntology_ran_a_sample":1439,"not_listed_spam_title":0,"listed":10580,"listed_where_code_ran":1439,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1228,"every_run_a_failure_of_syntologys_instrument":211,"listed_with_a_run_with_no_instrument_failure":1228,"listed_every_run_a_failure_of_syntologys_instrument":211,"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/representation-learning","prev":"/task/representation-learning/papers/2","next":"/task/representation-learning/papers/4","papers":[{"url":"/paper/variational-distillation-for-multi-view","slug":"variational-distillation-for-multi-view","title":"Variational Distillation for Multi-View Learning","date":"2022-06-20","arxiv_id":"2206.09548","repositories_listed":3,"syntology":null},{"url":"/paper/masked-frequency-modeling-for-self-supervised","slug":"masked-frequency-modeling-for-self-supervised","title":"Masked Frequency Modeling for Self-Supervised Visual Pre-Training","date":"2022-06-15","arxiv_id":"2206.07706","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/masked-frequency-modeling-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2206.07706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07706"}},"official":{"repos":["jiahao000/mfm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/contrastive-learning-unifies-t-sne-and-umap","slug":"contrastive-learning-unifies-t-sne-and-umap","title":"From $t$-SNE to UMAP with contrastive learning","date":"2022-06-03","arxiv_id":"2206.01816","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contrastive-learning-unifies-t-sne-and-umap#ran","syntology_url":"https://syntology.ai/paper/2206.01816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01816"}},"official":{"repos":["hci-unihd/cl-tsne-umap","berenslab/contrastive-ne"],"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/point-m2ae-multi-scale-masked-autoencoders","slug":"point-m2ae-multi-scale-masked-autoencoders","title":"Point-M2AE: Multi-scale Masked Autoencoders for Hierarchical Point Cloud Pre-training","date":"2022-05-28","arxiv_id":"2205.14401","repositories_listed":3,"syntology":null},{"url":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}},"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/integral-migrating-pre-trained-transformer","slug":"integral-migrating-pre-trained-transformer","title":"Integrally Migrating Pre-trained Transformer Encoder-decoders for Visual Object Detection","date":"2022-05-19","arxiv_id":"2205.09613","repositories_listed":3,"syntology":null},{"url":"/paper/robust-and-efficient-medical-imaging-with","slug":"robust-and-efficient-medical-imaging-with","title":"Robust and Efficient Medical Imaging with Self-Supervision","date":"2022-05-19","arxiv_id":"2205.09723","repositories_listed":3,"syntology":{"n":28,"n_ran":20,"n_constructed":0,"n_ran_checked":16,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":15,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 1 violated, 15 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/robust-and-efficient-medical-imaging-with#ran","syntology_url":"https://syntology.ai/paper/2205.09723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09723"}},"official":{"repos":["google-research/big_transfer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/masked-autoencoders-as-spatiotemporal","slug":"masked-autoencoders-as-spatiotemporal","title":"Masked Autoencoders As Spatiotemporal Learners","date":"2022-05-18","arxiv_id":"2205.09113","repositories_listed":3,"syntology":null},{"url":"/paper/fednest-federated-bilevel-minimax-and","slug":"fednest-federated-bilevel-minimax-and","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","date":"2022-05-04","arxiv_id":"2205.02215","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fednest-federated-bilevel-minimax-and#ran","syntology_url":"https://syntology.ai/paper/2205.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02215"}},"official":{"repos":["ucr-optml/FedNest"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/towards-universal-backward-compatible","slug":"towards-universal-backward-compatible","title":"Towards Universal Backward-Compatible Representation Learning","date":"2022-03-03","arxiv_id":"2203.01583","repositories_listed":3,"syntology":null},{"url":"/paper/algorithm-and-system-co-design-for-efficient","slug":"algorithm-and-system-co-design-for-efficient","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","date":"2022-02-28","arxiv_id":"2202.13538","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/algorithm-and-system-co-design-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2202.13538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13538"}},"official":{"repos":["graph-com/surel"],"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/automated-attack-synthesis-by-extracting-1","slug":"automated-attack-synthesis-by-extracting-1","title":"Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents","date":"2022-02-18","arxiv_id":"2202.09470","repositories_listed":3,"syntology":null},{"url":"/paper/a-survey-of-pretraining-on-graphs-taxonomy","slug":"a-survey-of-pretraining-on-graphs-taxonomy","title":"A Survey of Pretraining on Graphs: Taxonomy, Methods, and Applications","date":"2022-02-16","arxiv_id":"2202.07893","repositories_listed":3,"syntology":null},{"url":"/paper/structure-aware-transformer-for-graph","slug":"structure-aware-transformer-for-graph","title":"Structure-Aware Transformer for Graph Representation Learning","date":"2022-02-07","arxiv_id":"2202.03036","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structure-aware-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.03036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03036"}},"official":{"repos":["borgwardtlab/sat"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/crossloc-scalable-aerial-localization","slug":"crossloc-scalable-aerial-localization","title":"CrossLoc: Scalable Aerial Localization Assisted by Multimodal Synthetic Data","date":"2021-12-16","arxiv_id":"2112.09081","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/crossloc-scalable-aerial-localization#ran","syntology_url":"https://syntology.ai/paper/2112.09081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.09081"}},"official":{"repos":["topo-epfl/crossloc","TOPO-EPFL/TOPO-DataGen"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/diffusion-autoencoders-toward-a-meaningful","slug":"diffusion-autoencoders-toward-a-meaningful","title":"Diffusion Autoencoders: Toward a Meaningful and Decodable Representation","date":"2021-11-30","arxiv_id":"2111.15640","repositories_listed":3,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/diffusion-autoencoders-toward-a-meaningful#ran","syntology_url":"https://syntology.ai/paper/2111.15640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15640"}},"official":{"repos":["phizaz/diffae"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rave-a-variational-autoencoder-for-fast-and-1","slug":"rave-a-variational-autoencoder-for-fast-and-1","title":"RAVE: A variational autoencoder for fast and high-quality neural audio synthesis","date":"2021-11-09","arxiv_id":"2111.05011","repositories_listed":3,"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":1,"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/rave-a-variational-autoencoder-for-fast-and-1#ran","syntology_url":"https://syntology.ai/paper/2111.05011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05011"}},"official":{"repos":["caillonantoine/RAVE"],"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/clip-adapter-better-vision-language-models","slug":"clip-adapter-better-vision-language-models","title":"CLIP-Adapter: Better Vision-Language Models with Feature Adapters","date":"2021-10-09","arxiv_id":"2110.04544","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clip-adapter-better-vision-language-models#ran","syntology_url":"https://syntology.ai/paper/2110.04544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04544"}},"official":{"repos":["gaopengcuhk/clip-adapter"],"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/uniformer-unified-transformer-for-efficient","slug":"uniformer-unified-transformer-for-efficient","title":"UniFormer: Unified Transformer for Efficient Spatial-Temporal Representation Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/webqa-multihop-and-multimodal-qa","slug":"webqa-multihop-and-multimodal-qa","title":"WebQA: Multihop and Multimodal QA","date":"2021-09-01","arxiv_id":"2109.00590","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/webqa-multihop-and-multimodal-qa#ran","syntology_url":"https://syntology.ai/paper/2109.00590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00590"}},"official":null}},{"url":"/paper/multibench-multiscale-benchmarks-for","slug":"multibench-multiscale-benchmarks-for","title":"MultiBench: Multiscale Benchmarks for Multimodal Representation Learning","date":"2021-07-15","arxiv_id":"2107.07502","repositories_listed":3,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multibench-multiscale-benchmarks-for#ran","syntology_url":"https://syntology.ai/paper/2107.07502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07502"}},"official":{"repos":["pliang279/MultiBench","pliang279/awesome-multimodal-ml"],"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":["found_in_text","official"]}}},{"url":"/paper/power-law-graph-transformer-for-machine","slug":"power-law-graph-transformer-for-machine","title":"Power Law Graph Transformer for Machine Translation and Representation Learning","date":"2021-06-27","arxiv_id":"2107.02039","repositories_listed":3,"syntology":null},{"url":"/paper/voice2series-reprogramming-acoustic-models","slug":"voice2series-reprogramming-acoustic-models","title":"Voice2Series: Reprogramming Acoustic Models for Time Series Classification","date":"2021-06-17","arxiv_id":"2106.09296","repositories_listed":3,"syntology":{"n":7,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"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) · 6 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/voice2series-reprogramming-acoustic-models#ran","syntology_url":"https://syntology.ai/paper/2106.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09296"}},"official":{"repos":["huckiyang/Voice2Series-Reprogramming"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-predictive-coding-for-model-based","slug":"temporal-predictive-coding-for-model-based","title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","date":"2021-06-14","arxiv_id":"2106.07156","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/temporal-predictive-coding-for-model-based#ran","syntology_url":"https://syntology.ai/paper/2106.07156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07156"}},"official":{"repos":["VinAIResearch/TPC-tensorflow","tung-nd/TPC-tensorflow"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-unsupervised-semantic","slug":"large-scale-unsupervised-semantic","title":"Large-scale Unsupervised Semantic Segmentation","date":"2021-06-06","arxiv_id":"2106.03149","repositories_listed":3,"syntology":null},{"url":"/paper/database-workload-characterization-with-query","slug":"database-workload-characterization-with-query","title":"Database Workload Characterization with Query Plan Encoders","date":"2021-05-26","arxiv_id":"2105.12287","repositories_listed":3,"syntology":null},{"url":"/paper/tcl-transformer-based-dynamic-graph-modelling","slug":"tcl-transformer-based-dynamic-graph-modelling","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","date":"2021-05-17","arxiv_id":"2105.07944","repositories_listed":3,"syntology":null},{"url":"/paper/seeing-out-of-the-box-end-to-end-pre-training","slug":"seeing-out-of-the-box-end-to-end-pre-training","title":"Seeing Out of tHe bOx: End-to-End Pre-training for Vision-Language Representation Learning","date":"2021-04-07","arxiv_id":"2104.03135","repositories_listed":3,"syntology":null},{"url":"/paper/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/e-graphsage-a-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2103.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16329"}},"official":{"repos":["waimorris/E-GraphSAGE"],"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/automix-unveiling-the-power-of-mixup","slug":"automix-unveiling-the-power-of-mixup","title":"AutoMix: Unveiling the Power of Mixup for Stronger Classifiers","date":"2021-03-24","arxiv_id":"2103.13027","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/automix-unveiling-the-power-of-mixup#ran","syntology_url":"https://syntology.ai/paper/2103.13027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13027"}},"official":{"repos":["Westlake-AI/openmixup"],"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/ssd-a-unified-framework-for-self-supervised-1","slug":"ssd-a-unified-framework-for-self-supervised-1","title":"SSD: A Unified Framework for Self-Supervised Outlier Detection","date":"2021-03-22","arxiv_id":"2103.12051","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/ssd-a-unified-framework-for-self-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2103.12051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12051"}},"official":{"repos":["inspire-group/SSD"],"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/byol-for-audio-self-supervised-learning-for","slug":"byol-for-audio-self-supervised-learning-for","title":"BYOL for Audio: Self-Supervised Learning for General-Purpose Audio Representation","date":"2021-03-11","arxiv_id":"2103.06695","repositories_listed":3,"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":4,"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/byol-for-audio-self-supervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/2103.06695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06695"}},"official":{"repos":["nttcslab/byol-a"],"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","unlocated"]}}},{"url":"/paper/ffb6d-a-full-flow-bidirectional-fusion","slug":"ffb6d-a-full-flow-bidirectional-fusion","title":"FFB6D: A Full Flow Bidirectional Fusion Network for 6D Pose Estimation","date":"2021-03-03","arxiv_id":"2103.02242","repositories_listed":3,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/ffb6d-a-full-flow-bidirectional-fusion#ran","syntology_url":"https://syntology.ai/paper/2103.02242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02242"}},"official":{"repos":["ethnhe/FFB6D"],"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/wit-wikipedia-based-image-text-dataset-for","slug":"wit-wikipedia-based-image-text-dataset-for","title":"WIT: Wikipedia-based Image Text Dataset for Multimodal Multilingual Machine Learning","date":"2021-03-02","arxiv_id":"2103.01913","repositories_listed":3,"syntology":null},{"url":"/paper/towards-a-unified-framework-for-fair-and","slug":"towards-a-unified-framework-for-fair-and","title":"Towards a Unified Framework for Fair and Stable Graph Representation Learning","date":"2021-02-25","arxiv_id":"2102.13186","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-a-unified-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2102.13186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13186"}},"official":{"repos":["chirag126/nifty"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/beyond-fully-connected-layers-with","slug":"beyond-fully-connected-layers-with","title":"Beyond Fully-Connected Layers with Quaternions: Parameterization of Hypercomplex Multiplications with $1/n$ Parameters","date":"2021-02-17","arxiv_id":"2102.08597","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/beyond-fully-connected-layers-with#ran","syntology_url":"https://syntology.ai/paper/2102.08597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08597"}},"official":{"repos":["astonzhang/Parameterization-of-Hypercomplex-Multiplications"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/exploiting-shared-representations-for","slug":"exploiting-shared-representations-for","title":"Exploiting Shared Representations for Personalized Federated Learning","date":"2021-02-14","arxiv_id":"2102.07078","repositories_listed":3,"syntology":null},{"url":"/paper/online-limited-memory-neural-linear-bandits-1","slug":"online-limited-memory-neural-linear-bandits-1","title":"Online Limited Memory Neural-Linear Bandits with Likelihood Matching","date":"2021-02-07","arxiv_id":"2102.03799","repositories_listed":3,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/online-limited-memory-neural-linear-bandits-1#ran","syntology_url":"https://syntology.ai/paper/2102.03799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03799"}},"official":null}},{"url":"/paper/does-continual-learning-catastrophic","slug":"does-continual-learning-catastrophic","title":"The Surprising Positive Knowledge Transfer in Continual 3D Object Shape Reconstruction","date":"2021-01-18","arxiv_id":"2101.07295","repositories_listed":3,"syntology":null},{"url":"/paper/towards-impartial-multi-task-learning","slug":"towards-impartial-multi-task-learning","title":"Towards Impartial Multi-task Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/neural-body-implicit-neural-representations","slug":"neural-body-implicit-neural-representations","title":"Neural Body: Implicit Neural Representations with Structured Latent Codes for Novel View Synthesis of Dynamic Humans","date":"2020-12-31","arxiv_id":"2012.15838","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-body-implicit-neural-representations#ran","syntology_url":"https://syntology.ai/paper/2012.15838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15838"}},"official":{"repos":["zju3dv/neuralbody"],"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/online-bag-of-visual-words-generation-for","slug":"online-bag-of-visual-words-generation-for","title":"OBoW: Online Bag-of-Visual-Words Generation for Self-Supervised Learning","date":"2020-12-21","arxiv_id":"2012.11552","repositories_listed":3,"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/online-bag-of-visual-words-generation-for#ran","syntology_url":"https://syntology.ai/paper/2012.11552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.11552"}},"official":{"repos":["valeoai/obow"],"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/comatch-semi-supervised-learning-with","slug":"comatch-semi-supervised-learning-with","title":"CoMatch: Semi-supervised Learning with Contrastive Graph Regularization","date":"2020-11-23","arxiv_id":"2011.11183","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/comatch-semi-supervised-learning-with#ran","syntology_url":"https://syntology.ai/paper/2011.11183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11183"}},"official":{"repos":["salesforce/CoMatch"],"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/multiresolution-knowledge-distillation-for","slug":"multiresolution-knowledge-distillation-for","title":"Multiresolution Knowledge Distillation for Anomaly Detection","date":"2020-11-22","arxiv_id":"2011.11108","repositories_listed":3,"syntology":null},{"url":"/paper/x-class-text-classification-with-extremely","slug":"x-class-text-classification-with-extremely","title":"X-Class: Text Classification with Extremely Weak Supervision","date":"2020-10-24","arxiv_id":"2010.12794","repositories_listed":3,"syntology":null},{"url":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","repositories_listed":3,"syntology":null},{"url":"/paper/chemberta-large-scale-self-supervised","slug":"chemberta-large-scale-self-supervised","title":"ChemBERTa: Large-Scale Self-Supervised Pretraining for Molecular Property Prediction","date":"2020-10-19","arxiv_id":"2010.09885","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"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 1 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/chemberta-large-scale-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2010.09885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09885"}},"official":{"repos":["seyonechithrananda/bert-loves-chemistry"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/i-mix-a-strategy-for-regularizing-contrastive-1","slug":"i-mix-a-strategy-for-regularizing-contrastive-1","title":"i-Mix: A Domain-Agnostic Strategy for Contrastive Representation Learning","date":"2020-10-17","arxiv_id":"2010.08887","repositories_listed":3,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 4 unverified","sample_list":"/paper/i-mix-a-strategy-for-regularizing-contrastive-1#ran","syntology_url":"https://syntology.ai/paper/2010.08887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08887"}},"official":{"repos":["kibok90/imix"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-rank-minimizing-autoencoder","slug":"implicit-rank-minimizing-autoencoder","title":"Implicit Rank-Minimizing Autoencoder","date":"2020-10-01","arxiv_id":"2010.00679","repositories_listed":3,"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/implicit-rank-minimizing-autoencoder#ran","syntology_url":"https://syntology.ai/paper/2010.00679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00679"}},"official":{"repos":["facebookresearch/irmae"],"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/sub-graph-contrast-for-scalable-self","slug":"sub-graph-contrast-for-scalable-self","title":"Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning","date":"2020-09-22","arxiv_id":"2009.10273","repositories_listed":3,"syntology":null},{"url":"/paper/aag-self-supervised-representation-learning","slug":"aag-self-supervised-representation-learning","title":"AAG: Self-Supervised Representation Learning by Auxiliary Augmentation with GNT-Xent Loss","date":"2020-09-17","arxiv_id":"2009.07994","repositories_listed":3,"syntology":null},{"url":"/paper/decoupling-representation-learning-from","slug":"decoupling-representation-learning-from","title":"Decoupling Representation Learning from Reinforcement Learning","date":"2020-09-14","arxiv_id":"2009.08319","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decoupling-representation-learning-from#ran","syntology_url":"https://syntology.ai/paper/2009.08319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08319"}},"official":{"repos":["astooke/rlpyt"],"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/enhancing-unsupervised-video-representation","slug":"enhancing-unsupervised-video-representation","title":"Enhancing Unsupervised Video Representation Learning by Decoupling the Scene and the Motion","date":"2020-09-12","arxiv_id":"2009.05757","repositories_listed":3,"syntology":null},{"url":"/paper/seco-exploring-sequence-supervision-for","slug":"seco-exploring-sequence-supervision-for","title":"SeCo: Exploring Sequence Supervision for Unsupervised Representation Learning","date":"2020-08-03","arxiv_id":"2008.00975","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/seco-exploring-sequence-supervision-for#ran","syntology_url":"https://syntology.ai/paper/2008.00975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00975"}},"official":{"repos":["YihengZhang-CV/SeCo-Sequence-Contrastive-Learning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-deeper-graph-neural-networks","slug":"towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"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/towards-deeper-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09296"}},"official":{"repos":["divelab/DeeperGNN"],"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","unlocated"]}}},{"url":"/paper/grover-self-supervised-message-passing","slug":"grover-self-supervised-message-passing","title":"Self-Supervised Graph Transformer on Large-Scale Molecular Data","date":"2020-06-18","arxiv_id":"2007.02835","repositories_listed":3,"syntology":null},{"url":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","slug":"deepergcn-all-you-need-to-train-deeper-gcns","title":"DeeperGCN: All You Need to Train Deeper GCNs","date":"2020-06-13","arxiv_id":"2006.07739","repositories_listed":3,"syntology":null},{"url":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}},"official":{"repos":["CRIPAC-DIG/GRACE"],"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/improving-convolutional-networks-with-self","slug":"improving-convolutional-networks-with-self","title":"Improving Convolutional Networks With Self-Calibrated Convolutions","date":"2020-06-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/interpretable-contrastive-learning-for","slug":"interpretable-contrastive-learning-for","title":"Network Comparison with Interpretable Contrastive Network Representation Learning","date":"2020-05-25","arxiv_id":"2005.12419","repositories_listed":3,"syntology":null},{"url":"/paper/graph-structure-learning-for-robust-graph","slug":"graph-structure-learning-for-robust-graph","title":"Graph Structure Learning for Robust Graph Neural Networks","date":"2020-05-20","arxiv_id":"2005.10203","repositories_listed":3,"syntology":null},{"url":"/paper/neural-collaborative-reasoning","slug":"neural-collaborative-reasoning","title":"Neural Collaborative Reasoning","date":"2020-05-16","arxiv_id":"2005.08129","repositories_listed":3,"syntology":null},{"url":"/paper/hero-hierarchical-encoder-for-video-language","slug":"hero-hierarchical-encoder-for-video-language","title":"HERO: Hierarchical Encoder for Video+Language Omni-representation Pre-training","date":"2020-05-01","arxiv_id":"2005.00200","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hero-hierarchical-encoder-for-video-language#ran","syntology_url":"https://syntology.ai/paper/2005.00200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00200"}},"official":{"repos":["linjieli222/HERO"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/vehiclenet-learning-robust-visual","slug":"vehiclenet-learning-robust-visual","title":"VehicleNet: Learning Robust Visual Representation for Vehicle Re-identification","date":"2020-04-14","arxiv_id":"2004.06305","repositories_listed":3,"syntology":null},{"url":"/paper/towards-backward-compatible-representation","slug":"towards-backward-compatible-representation","title":"Towards Backward-Compatible Representation Learning","date":"2020-03-26","arxiv_id":"2003.11942","repositories_listed":3,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/towards-backward-compatible-representation#ran","syntology_url":"https://syntology.ai/paper/2003.11942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11942"}},"official":{"repos":["YantaoShen/openBCT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/rethinking-image-mixture-for-unsupervised","slug":"rethinking-image-mixture-for-unsupervised","title":"Un-Mix: Rethinking Image Mixtures for Unsupervised Visual Representation Learning","date":"2020-03-11","arxiv_id":"2003.05438","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/rethinking-image-mixture-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2003.05438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05438"}},"official":{"repos":["szq0214/Rethinking-Image-Mixture-for-Unsupervised-Learning","szq0214/un-mix"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/do-we-really-need-to-access-the-source-data","slug":"do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","arxiv_id":"2002.08546","repositories_listed":3,"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/do-we-really-need-to-access-the-source-data#ran","syntology_url":"https://syntology.ai/paper/2002.08546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08546"}},"official":{"repos":["tim-learn/SHOT"],"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/learning-robust-representations-via-multi-1","slug":"learning-robust-representations-via-multi-1","title":"Learning Robust Representations via Multi-View Information Bottleneck","date":"2020-02-17","arxiv_id":"2002.07017","repositories_listed":3,"syntology":null},{"url":"/paper/anomalydae-dual-autoencoder-for-anomaly","slug":"anomalydae-dual-autoencoder-for-anomaly","title":"AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks","date":"2020-02-10","arxiv_id":"2002.03665","repositories_listed":3,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/anomalydae-dual-autoencoder-for-anomaly#ran","syntology_url":"https://syntology.ai/paper/2002.03665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03665"}},"official":{"repos":["haoyfan/AnomalyDAE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/a-gentle-introduction-to-deep-learning-for","slug":"a-gentle-introduction-to-deep-learning-for","title":"A Gentle Introduction to Deep Learning for Graphs","date":"2019-12-29","arxiv_id":"1912.12693","repositories_listed":3,"syntology":null},{"url":"/paper/contrastive-learning-of-structured-world-1","slug":"contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","arxiv_id":"1911.12247","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-learning-of-structured-world-1#ran","syntology_url":"https://syntology.ai/paper/1911.12247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12247"}},"official":{"repos":["tkipf/c-swm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-label-classification-with-label-graph","slug":"multi-label-classification-with-label-graph","title":"Multi-Label Classification with Label Graph Superimposing","date":"2019-11-21","arxiv_id":"1911.09243","repositories_listed":3,"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/multi-label-classification-with-label-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09243"}},"official":null}},{"url":"/paper/muse-parallel-multi-scale-attention-for","slug":"muse-parallel-multi-scale-attention-for","title":"MUSE: Parallel Multi-Scale Attention for Sequence to Sequence Learning","date":"2019-11-17","arxiv_id":"1911.09483","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/muse-parallel-multi-scale-attention-for#ran","syntology_url":"https://syntology.ai/paper/1911.09483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09483"}},"official":{"repos":["lancopku/MUSE"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","repositories_listed":3,"syntology":null},{"url":"/paper/predicting-materials-properties-without","slug":"predicting-materials-properties-without","title":"Predicting materials properties without crystal structure: Deep representation learning from stoichiometry","date":"2019-10-01","arxiv_id":"1910.00617","repositories_listed":3,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/predicting-materials-properties-without#ran","syntology_url":"https://syntology.ai/paper/1910.00617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00617"}},"official":{"repos":["CompRhys/roost"],"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/video-action-classification-using-prednet","slug":"video-action-classification-using-prednet","title":"PredNet and Predictive Coding: A Critical Review","date":"2019-06-14","arxiv_id":"1906.11902","repositories_listed":3,"syntology":null},{"url":"/paper/190600910","slug":"190600910","title":"Learning Representations by Maximizing Mutual Information Across Views","date":"2019-06-03","arxiv_id":"1906.00910","repositories_listed":3,"syntology":{"n":11,"n_ran":8,"n_constructed":5,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"8 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190600910#ran","syntology_url":"https://syntology.ai/paper/1906.00910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00910"}},"official":null}},{"url":"/paper/emphasis-regularisation-by-gradient-rescaling","slug":"emphasis-regularisation-by-gradient-rescaling","title":"Derivative Manipulation for General Example Weighting","date":"2019-05-27","arxiv_id":"1905.11233","repositories_listed":3,"syntology":null},{"url":"/paper/on-variational-bounds-of-mutual-information","slug":"on-variational-bounds-of-mutual-information","title":"On Variational Bounds of Mutual Information","date":"2019-05-16","arxiv_id":"1905.06922","repositories_listed":3,"syntology":{"n":21,"n_ran":17,"n_constructed":1,"n_ran_checked":16,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":1,"phrase":"17 ran (of which 1 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-variational-bounds-of-mutual-information#ran","syntology_url":"https://syntology.ai/paper/1905.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06922"}},"official":null}},{"url":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}},"official":{"repos":["HongyangGao/gunet"],"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/influence-maximization-via-representation","slug":"influence-maximization-via-representation","title":"Multi-task Learning for Influence Estimation and Maximization","date":"2019-04-18","arxiv_id":"1904.08804","repositories_listed":3,"syntology":null},{"url":"/paper/videobert-a-joint-model-for-video-and","slug":"videobert-a-joint-model-for-video-and","title":"VideoBERT: A Joint Model for Video and Language Representation Learning","date":"2019-04-03","arxiv_id":"1904.01766","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/videobert-a-joint-model-for-video-and#ran","syntology_url":"https://syntology.ai/paper/1904.01766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01766"}},"official":null}},{"url":"/paper/minatar-an-atari-inspired-testbed-for-more","slug":"minatar-an-atari-inspired-testbed-for-more","title":"MinAtar: An Atari-Inspired Testbed for Thorough and Reproducible Reinforcement Learning Experiments","date":"2019-03-07","arxiv_id":"1903.03176","repositories_listed":3,"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/minatar-an-atari-inspired-testbed-for-more#ran","syntology_url":"https://syntology.ai/paper/1903.03176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03176"}},"official":{"repos":["kenjyoung/MinAtar"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/learning-representations-of-irregular","slug":"learning-representations-of-irregular","title":"Learning representations of irregular particle-detector geometry with distance-weighted graph networks","date":"2019-02-21","arxiv_id":"1902.07987","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-representations-of-irregular#ran","syntology_url":"https://syntology.ai/paper/1902.07987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07987"}},"official":{"repos":["jkiesele/caloGraphNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/unsupervised-feature-learning-of-human","slug":"unsupervised-feature-learning-of-human","title":"Unsupervised Feature Learning of Human Actions as Trajectories in Pose Embedding Manifold","date":"2018-12-06","arxiv_id":"1812.02592","repositories_listed":3,"syntology":null},{"url":"/paper/towards-accurate-generative-models-of-video-a","slug":"towards-accurate-generative-models-of-video-a","title":"Towards Accurate Generative Models of Video: A New Metric & Challenges","date":"2018-12-03","arxiv_id":"1812.01717","repositories_listed":3,"syntology":null},{"url":"/paper/combining-similarity-features-and-deep","slug":"combining-similarity-features-and-deep","title":"Combining Similarity Features and Deep Representation Learning for Stance Detection in the Context of Checking Fake News","date":"2018-11-02","arxiv_id":"1811.00706","repositories_listed":3,"syntology":null},{"url":"/paper/disentangled-representation-learning-for-non","slug":"disentangled-representation-learning-for-non","title":"Disentangled Representation Learning for Non-Parallel Text Style Transfer","date":"2018-08-13","arxiv_id":"1808.04339","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disentangled-representation-learning-for-non#ran","syntology_url":"https://syntology.ai/paper/1808.04339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04339"}},"official":{"repos":["vineetjohn/linguistic-style-transfer"],"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/simultaneous-edge-alignment-and-learning","slug":"simultaneous-edge-alignment-and-learning","title":"Simultaneous Edge Alignment and Learning","date":"2018-08-06","arxiv_id":"1808.01992","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/simultaneous-edge-alignment-and-learning#ran","syntology_url":"https://syntology.ai/paper/1808.01992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.01992"}},"official":{"repos":["Chrisding/seal","Chrisding/sbd-preprocess"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-representations-of-ultrahigh","slug":"learning-representations-of-ultrahigh","title":"Learning Representations of Ultrahigh-dimensional Data for Random Distance-based Outlier Detection","date":"2018-06-13","arxiv_id":"1806.04808","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-representations-of-ultrahigh#ran","syntology_url":"https://syntology.ai/paper/1806.04808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04808"}},"official":null}},{"url":"/paper/hyperdense-net-a-hyper-densely-connected-cnn","slug":"hyperdense-net-a-hyper-densely-connected-cnn","title":"HyperDense-Net: A hyper-densely connected CNN for multi-modal image segmentation","date":"2018-04-09","arxiv_id":"1804.02967","repositories_listed":3,"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/hyperdense-net-a-hyper-densely-connected-cnn#ran","syntology_url":"https://syntology.ai/paper/1804.02967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.02967"}},"official":{"repos":["josedolz/HyperDenseNet"],"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/hyperbolic-entailment-cones-for-learning","slug":"hyperbolic-entailment-cones-for-learning","title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","date":"2018-04-03","arxiv_id":"1804.01882","repositories_listed":3,"syntology":null},{"url":"/paper/dissent-sentence-representation-learning-from","slug":"dissent-sentence-representation-learning-from","title":"DisSent: Sentence Representation Learning from Explicit Discourse Relations","date":"2017-10-12","arxiv_id":"1710.04334","repositories_listed":3,"syntology":null},{"url":"/paper/learning-representations-and-generative","slug":"learning-representations-and-generative","title":"Learning Representations and Generative Models for 3D Point Clouds","date":"2017-07-08","arxiv_id":"1707.02392","repositories_listed":3,"syntology":null},{"url":"/paper/dataset-augmentation-in-feature-space","slug":"dataset-augmentation-in-feature-space","title":"Dataset Augmentation in Feature Space","date":"2017-02-17","arxiv_id":"1702.05538","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dataset-augmentation-in-feature-space#ran","syntology_url":"https://syntology.ai/paper/1702.05538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05538"}},"official":null}},{"url":"/paper/deep-generalized-canonical-correlation","slug":"deep-generalized-canonical-correlation","title":"Deep Generalized Canonical Correlation Analysis","date":"2017-02-08","arxiv_id":"1702.02519","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-generalized-canonical-correlation#ran","syntology_url":"https://syntology.ai/paper/1702.02519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02519"}},"official":{"repos":["bitbucket.org/adrianbenton/dgcca-py3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/joint-unsupervised-learning-of-deep","slug":"joint-unsupervised-learning-of-deep","title":"Joint Unsupervised Learning of Deep Representations and Image Clusters","date":"2016-04-13","arxiv_id":"1604.03628","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/joint-unsupervised-learning-of-deep#ran","syntology_url":"https://syntology.ai/paper/1604.03628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.03628"}},"official":{"repos":["jwyang/joint-unsupervised-learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-representations-for-automatic","slug":"learning-representations-for-automatic","title":"Learning Representations for Automatic Colorization","date":"2016-03-22","arxiv_id":"1603.06668","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-representations-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1603.06668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.06668"}},"official":{"repos":["gustavla/autocolorize"],"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/attentive-pooling-networks","slug":"attentive-pooling-networks","title":"Attentive Pooling Networks","date":"2016-02-11","arxiv_id":"1602.03609","repositories_listed":3,"syntology":null},{"url":"/paper/network-representation-learning-with-rich","slug":"network-representation-learning-with-rich","title":"Network Representation Learning with Rich Text Information","date":"2015-06-24","arxiv_id":null,"repositories_listed":3,"syntology":null}],"record_sha256":"751de77d82cb521df777ea519a307051ced09eb768ee8db447218dbb8dd527d0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}