{"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/42","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":42,"pages_in_order":106,"rows_per_page":100,"rows":[4101,4200],"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/41","next":"/task/representation-learning/papers/43","papers":[{"url":"/paper/contextualized-code-representation-learning","slug":"contextualized-code-representation-learning","title":"CoreGen: Contextualized Code Representation Learning for Commit Message Generation","date":"2020-07-14","arxiv_id":"2007.06934","repositories_listed":1,"syntology":null},{"url":"/paper/psconv-squeezing-feature-pyramid-into-one","slug":"psconv-squeezing-feature-pyramid-into-one","title":"PSConv: Squeezing Feature Pyramid into One Compact Poly-Scale Convolutional Layer","date":"2020-07-13","arxiv_id":"2007.06191","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-variational-autoencoder-based","slug":"disentangled-variational-autoencoder-based","title":"Disentangled Variational Autoencoder based Multi-Label Classification with Covariance-Aware Multivariate Probit Model","date":"2020-07-12","arxiv_id":"2007.06126","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-code-representation-learning","slug":"contrastive-code-representation-learning","title":"Contrastive Code Representation Learning","date":"2020-07-09","arxiv_id":"2007.04973","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"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/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/jgr-p2o-joint-graph-reasoning-based-pixel-to","slug":"jgr-p2o-joint-graph-reasoning-based-pixel-to","title":"JGR-P2O: Joint Graph Reasoning based Pixel-to-Offset Prediction Network for 3D Hand Pose Estimation from a Single Depth Image","date":"2020-07-09","arxiv_id":"2007.04646","repositories_listed":1,"syntology":null},{"url":"/paper/learning-retrospective-knowledge-with-reverse","slug":"learning-retrospective-knowledge-with-reverse","title":"Learning Retrospective Knowledge with Reverse Reinforcement Learning","date":"2020-07-09","arxiv_id":"2007.06703","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-and-unsupervised-graph","slug":"hierarchical-and-unsupervised-graph","title":"Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening","date":"2020-07-07","arxiv_id":"2007.03373","repositories_listed":1,"syntology":null},{"url":"/paper/nested-subspace-arrangement-for","slug":"nested-subspace-arrangement-for","title":"Nested Subspace Arrangement for Representation of Relational Data","date":"2020-07-04","arxiv_id":"2007.02007","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/nested-subspace-arrangement-for#ran","syntology_url":"https://syntology.ai/paper/2007.02007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02007"}},"official":{"repos":["KyushuUniversityMathematics/DANCAR"],"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/data-augmenting-contrastive-learning-of","slug":"data-augmenting-contrastive-learning-of","title":"Data Augmenting Contrastive Learning of Speech Representations in the Time Domain","date":"2020-07-02","arxiv_id":"2007.00991","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchically-organized-latent-modules-for","slug":"hierarchically-organized-latent-modules-for","title":"Hierarchically Organized Latent Modules for Exploratory Search in Morphogenetic Systems","date":"2020-07-02","arxiv_id":"2007.01195","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchically-organized-latent-modules-for#ran","syntology_url":"https://syntology.ai/paper/2007.01195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01195"}},"official":{"repos":["flowersteam/holmes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/maximizing-cohesion-and-separation-in-graph","slug":"maximizing-cohesion-and-separation-in-graph","title":"Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling Approach","date":"2020-07-02","arxiv_id":"2007.01423","repositories_listed":1,"syntology":null},{"url":"/paper/autoencoding-keyword-correlation-graph-for","slug":"autoencoding-keyword-correlation-graph-for","title":"Autoencoding Keyword Correlation Graph for Document Clustering","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/debiased-contrastive-learning","slug":"debiased-contrastive-learning","title":"Debiased Contrastive Learning","date":"2020-07-01","arxiv_id":"2007.00224","repositories_listed":1,"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/debiased-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2007.00224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00224"}},"official":{"repos":["chingyaoc/DCL"],"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/gcn-bmp-investigating-graph-representation","slug":"gcn-bmp-investigating-graph-representation","title":"GCN-BMP: Investigating Graph Representation Learning for DDI Prediction Task","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ultrahyperbolic-representation-learning","slug":"ultrahyperbolic-representation-learning","title":"Ultrahyperbolic Representation Learning","date":"2020-07-01","arxiv_id":"2007.00211","repositories_listed":1,"syntology":null},{"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/video-representation-learning-with-visual","slug":"video-representation-learning-with-visual","title":"Video Representation Learning with Visual Tempo Consistency","date":"2020-06-28","arxiv_id":"2006.15489","repositories_listed":1,"syntology":null},{"url":"/paper/turl-table-understanding-through","slug":"turl-table-understanding-through","title":"TURL: Table Understanding through Representation Learning","date":"2020-06-26","arxiv_id":"2006.14806","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/turl-table-understanding-through#ran","syntology_url":"https://syntology.ai/paper/2006.14806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14806"}},"official":{"repos":["sunlab-osu/TURL"],"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/unsupervised-discovery-of-object-landmarks","slug":"unsupervised-discovery-of-object-landmarks","title":"On Equivariant and Invariant Learning of Object Landmark Representations","date":"2020-06-26","arxiv_id":"2006.14787","repositories_listed":1,"syntology":null},{"url":"/paper/space-time-correspondence-as-a-contrastive","slug":"space-time-correspondence-as-a-contrastive","title":"Space-Time Correspondence as a Contrastive Random Walk","date":"2020-06-25","arxiv_id":"2006.14613","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"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, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/space-time-correspondence-as-a-contrastive#ran","syntology_url":"https://syntology.ai/paper/2006.14613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14613"}},"official":{"repos":["ajabri/videowalk"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/time-varying-graph-representation-learning","slug":"time-varying-graph-representation-learning","title":"Time-varying Graph Representation Learning via Higher-Order Skip-Gram with Negative Sampling","date":"2020-06-25","arxiv_id":"2006.14330","repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-and-best-practices-for-biomedical-1","slug":"benchmark-and-best-practices-for-biomedical-1","title":"Benchmark and Best Practices for Biomedical Knowledge Graph Embeddings","date":"2020-06-24","arxiv_id":"2006.13774","repositories_listed":1,"syntology":null},{"url":"/paper/insights-from-the-future-for-continual","slug":"insights-from-the-future-for-continual","title":"Insights from the Future for Continual Learning","date":"2020-06-24","arxiv_id":"2006.13748","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-by-subspace-diffusion","slug":"disentangling-by-subspace-diffusion","title":"Disentangling by Subspace Diffusion","date":"2020-06-23","arxiv_id":"2006.12982","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/disentangling-by-subspace-diffusion#ran","syntology_url":"https://syntology.ai/paper/2006.12982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12982"}},"official":{"repos":["deepmind/deepmind-research"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-belief-network-based-representation","slug":"deep-belief-network-based-representation","title":"Deep Belief Network based representation learning for lncRNA-disease association prediction","date":"2020-06-22","arxiv_id":"2006.12534","repositories_listed":1,"syntology":null},{"url":"/paper/hnhn-hypergraph-networks-with-hyperedge","slug":"hnhn-hypergraph-networks-with-hyperedge","title":"HNHN: Hypergraph Networks with Hyperedge Neurons","date":"2020-06-22","arxiv_id":"2006.12278","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/hnhn-hypergraph-networks-with-hyperedge#ran","syntology_url":"https://syntology.ai/paper/2006.12278","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12278"}},"official":null}},{"url":"/paper/telescoping-density-ratio-estimation","slug":"telescoping-density-ratio-estimation","title":"Telescoping Density-Ratio Estimation","date":"2020-06-22","arxiv_id":"2006.12204","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/telescoping-density-ratio-estimation#ran","syntology_url":"https://syntology.ai/paper/2006.12204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12204"}},"official":null}},{"url":"/paper/unsupervised-image-classification-for-deep","slug":"unsupervised-image-classification-for-deep","title":"Unsupervised Image Classification for Deep Representation Learning","date":"2020-06-20","arxiv_id":"2006.11480","repositories_listed":1,"syntology":null},{"url":"/paper/video-playback-rate-perception-for-self-1","slug":"video-playback-rate-perception-for-self-1","title":"Video Playback Rate Perception for Self-supervisedSpatio-Temporal Representation Learning","date":"2020-06-20","arxiv_id":"2006.11476","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/video-playback-rate-perception-for-self-1#ran","syntology_url":"https://syntology.ai/paper/2006.11476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11476"}},"official":{"repos":["yuanyao366/PRP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/online-deep-clustering-for-unsupervised-1","slug":"online-deep-clustering-for-unsupervised-1","title":"Online Deep Clustering for Unsupervised Representation Learning","date":"2020-06-18","arxiv_id":"2006.10645","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-representation-learning-for-2","slug":"adversarial-representation-learning-for-2","title":"Adversarial representation learning for private speech generation","date":"2020-06-16","arxiv_id":"2006.09114","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-representation-learning-for-2#ran","syntology_url":"https://syntology.ai/paper/2006.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09114"}},"official":{"repos":["daverics/pcmelgan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/perl-pivot-based-domain-adaptation-for-pre","slug":"perl-pivot-based-domain-adaptation-for-pre","title":"PERL: Pivot-based Domain Adaptation for Pre-trained Deep Contextualized Embedding Models","date":"2020-06-16","arxiv_id":"2006.09075","repositories_listed":1,"syntology":null},{"url":"/paper/when-does-self-supervision-help-graph","slug":"when-does-self-supervision-help-graph","title":"When Does Self-Supervision Help Graph Convolutional Networks?","date":"2020-06-16","arxiv_id":"2006.09136","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-for-information","slug":"representation-learning-for-information","title":"Representation Learning for Information Extraction from Form-like Documents","date":"2020-06-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cascaded-deep-monocular-3d-human-pose-1","slug":"cascaded-deep-monocular-3d-human-pose-1","title":"Cascaded deep monocular 3D human pose estimation with evolutionary training data","date":"2020-06-14","arxiv_id":"2006.07778","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/cascaded-deep-monocular-3d-human-pose-1#ran","syntology_url":"https://syntology.ai/paper/2006.07778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07778"}},"official":{"repos":["Nicholasli1995/EvoSkeleton"],"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/survival-analysis-meets-counterfactual","slug":"survival-analysis-meets-counterfactual","title":"Enabling Counterfactual Survival Analysis with Balanced Representations","date":"2020-06-14","arxiv_id":"2006.07756","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-multi-relational-graph","slug":"generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","arxiv_id":"2006.07331","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/generalized-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/2006.07331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07331"}},"official":{"repos":["Maysir/GEM-GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-dimension-reduction-for-supervised","slug":"deep-dimension-reduction-for-supervised","title":"Deep Dimension Reduction for Supervised Representation Learning","date":"2020-06-10","arxiv_id":"2006.05865","repositories_listed":1,"syntology":null},{"url":"/paper/demystifying-self-supervised-learning-an","slug":"demystifying-self-supervised-learning-an","title":"Self-supervised Learning from a Multi-view Perspective","date":"2020-06-10","arxiv_id":"2006.05576","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/demystifying-self-supervised-learning-an#ran","syntology_url":"https://syntology.ai/paper/2006.05576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05576"}},"official":{"repos":["yaohungt/Demystifying_Self_Supervised_Learning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-level-semantic-transfer-deep-hashing-for","slug":"dual-level-semantic-transfer-deep-hashing-for","title":"Dual-level Semantic Transfer Deep Hashing for Efficient Social Image Retrieval","date":"2020-06-10","arxiv_id":"2006.05586","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-relational-reasoning-for","slug":"self-supervised-relational-reasoning-for","title":"Self-Supervised Relational Reasoning for Representation Learning","date":"2020-06-10","arxiv_id":"2006.05849","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/self-supervised-relational-reasoning-for#ran","syntology_url":"https://syntology.ai/paper/2006.05849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05849"}},"official":{"repos":["mpatacchiola/self-supervised-relational-reasoning"],"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/interpretable-deep-graph-generation-with-node","slug":"interpretable-deep-graph-generation-with-node","title":"Interpretable Deep Graph Generation with Node-Edge Co-Disentanglement","date":"2020-06-09","arxiv_id":"2006.05385","repositories_listed":1,"syntology":null},{"url":"/paper/neural-methods-for-point-wise-dependency","slug":"neural-methods-for-point-wise-dependency","title":"Neural Methods for Point-wise Dependency Estimation","date":"2020-06-09","arxiv_id":"2006.05553","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":9,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 2 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-methods-for-point-wise-dependency#ran","syntology_url":"https://syntology.ai/paper/2006.05553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05553"}},"official":{"repos":["yaohungt/Pointwise_Dependency_Neural_Estimation"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-representation-learning-for","slug":"continual-representation-learning-for","title":"Continual Representation Learning for Biometric Identification","date":"2020-06-08","arxiv_id":"2006.04455","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-network-via","slug":"graph-representation-learning-network-via","title":"Graph Representation Learning Network via Adaptive Sampling","date":"2020-06-08","arxiv_id":"2006.04637","repositories_listed":1,"syntology":null},{"url":"/paper/person-re-identification-in-the-3d-space","slug":"person-re-identification-in-the-3d-space","title":"Parameter-Efficient Person Re-identification in the 3D Space","date":"2020-06-08","arxiv_id":"2006.04569","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-graph-neural-networks-from","slug":"understanding-graph-neural-networks-from","title":"Understanding Graph Neural Networks from Graph Signal Denoising Perspectives","date":"2020-06-08","arxiv_id":"2006.04386","repositories_listed":1,"syntology":null},{"url":"/paper/improving-k-means-clustering-performance-with","slug":"improving-k-means-clustering-performance-with","title":"Improving k-Means Clustering Performance with Disentangled Internal Representations","date":"2020-06-05","arxiv_id":"2006.04535","repositories_listed":1,"syntology":null},{"url":"/paper/video-playback-rate-perception-for-self","slug":"video-playback-rate-perception-for-self","title":"Video Playback Rate Perception for Self-Supervised Spatio-Temporal Representation Learning","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pai-conv-permutable-anisotropic-convolutional","slug":"pai-conv-permutable-anisotropic-convolutional","title":"Permutation Matters: Anisotropic Convolutional Layer for Learning on Point Clouds","date":"2020-05-27","arxiv_id":"2005.13135","repositories_listed":1,"syntology":null},{"url":"/paper/rankpose-learning-generalised-feature-with","slug":"rankpose-learning-generalised-feature-with","title":"RankPose: Learning Generalised Feature with Rank Supervision for Head Pose Estimation","date":"2020-05-22","arxiv_id":"2005.10984","repositories_listed":1,"syntology":null},{"url":"/paper/an-analysis-on-the-use-of-autoencoders-for","slug":"an-analysis-on-the-use-of-autoencoders-for","title":"An analysis on the use of autoencoders for representation learning: fundamentals, learning task case studies, explainability and challenges","date":"2020-05-21","arxiv_id":"2005.10516","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-canonical-correlation-analysis","slug":"adversarial-canonical-correlation-analysis","title":"Adversarial Canonical Correlation Analysis","date":"2020-05-20","arxiv_id":"2005.10349","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-based-user-representation-learning-for","slug":"gcn-based-user-representation-learning-for","title":"GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detection","date":"2020-05-20","arxiv_id":"2005.10150","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/gcn-based-user-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2005.10150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10150"}},"official":null}},{"url":"/paper/m2grl-a-multi-task-multi-view-graph","slug":"m2grl-a-multi-task-multi-view-graph","title":"M2GRL: A Multi-task Multi-view Graph Representation Learning Framework for Web-scale Recommender Systems","date":"2020-05-20","arxiv_id":"2005.10110","repositories_listed":1,"syntology":null},{"url":"/paper/pretraining-with-contrastive-sentence","slug":"pretraining-with-contrastive-sentence","title":"Pretraining with Contrastive Sentence Objectives Improves Discourse Performance of Language Models","date":"2020-05-20","arxiv_id":"2005.10389","repositories_listed":1,"syntology":null},{"url":"/paper/what-makes-for-good-views-for-contrastive","slug":"what-makes-for-good-views-for-contrastive","title":"What Makes for Good Views for Contrastive Learning?","date":"2020-05-20","arxiv_id":"2005.10243","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-with-fine-grained","slug":"representation-learning-with-fine-grained","title":"Weakly Supervised Representation Learning with Coarse Labels","date":"2020-05-19","arxiv_id":"2005.09681","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-with-fine-grained#ran","syntology_url":"https://syntology.ai/paper/2005.09681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09681"}},"official":{"repos":["idstcv/coins"],"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","unlocated"]}}},{"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/a-novel-fusion-of-attention-and-sequence-to","slug":"a-novel-fusion-of-attention-and-sequence-to","title":"A Novel Fusion of Attention and Sequence to Sequence Autoencoders to Predict Sleepiness From Speech","date":"2020-05-15","arxiv_id":"2005.08722","repositories_listed":1,"syntology":null},{"url":"/paper/supervision-and-source-domain-impact-on","slug":"supervision-and-source-domain-impact-on","title":"Supervision and Source Domain Impact on Representation Learning: A Histopathology Case Study","date":"2020-05-10","arxiv_id":"2005.08629","repositories_listed":1,"syntology":null},{"url":"/paper/a-showcase-of-the-use-of-autoencoders-in","slug":"a-showcase-of-the-use-of-autoencoders-in","title":"A Showcase of the Use of Autoencoders in Feature Learning Applications","date":"2020-05-08","arxiv_id":"2005.04321","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/plan2vec-unsupervised-representation-learning-1","slug":"plan2vec-unsupervised-representation-learning-1","title":"Plan2Vec: Unsupervised Representation Learning by Latent Plans","date":"2020-05-07","arxiv_id":"2005.03648","repositories_listed":1,"syntology":null},{"url":"/paper/alignshift-bridging-the-gap-of-imaging","slug":"alignshift-bridging-the-gap-of-imaging","title":"AlignShift: Bridging the Gap of Imaging Thickness in 3D Anisotropic Volumes","date":"2020-05-05","arxiv_id":"2005.01969","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-of-physical-laws-from-scarce","slug":"deep-learning-of-physical-laws-from-scarce","title":"Physics-informed learning of governing equations from scarce data","date":"2020-05-05","arxiv_id":"2005.03448","repositories_listed":1,"syntology":null},{"url":"/paper/interpreting-rate-distortion-of-variational","slug":"interpreting-rate-distortion-of-variational","title":"Interpreting Rate-Distortion of Variational Autoencoder and Using Model Uncertainty for Anomaly Detection","date":"2020-05-05","arxiv_id":"2005.01889","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-information-gradient-estimation-for-1","slug":"mutual-information-gradient-estimation-for-1","title":"Mutual Information Gradient Estimation for Representation Learning","date":"2020-05-03","arxiv_id":"2005.01123","repositories_listed":1,"syntology":null},{"url":"/paper/isobn-fine-tuning-bert-with-isotropic-batch","slug":"isobn-fine-tuning-bert-with-isotropic-batch","title":"IsoBN: Fine-Tuning BERT with Isotropic Batch Normalization","date":"2020-05-02","arxiv_id":"2005.02178","repositories_listed":1,"syntology":null},{"url":"/paper/a-joint-framework-for-inductive","slug":"a-joint-framework-for-inductive","title":"Explainable Link Prediction for Emerging Entities in Knowledge Graphs","date":"2020-05-01","arxiv_id":"2005.00637","repositories_listed":1,"syntology":null},{"url":"/paper/a-naturalness-evaluation-database-for-video","slug":"a-naturalness-evaluation-database-for-video","title":"Understanding the Perceived Quality of Video Predictions","date":"2020-05-01","arxiv_id":"2005.00356","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-self-attention-for-interpretable","slug":"multi-view-self-attention-for-interpretable","title":"Multi-View Self-Attention for Interpretable Drug-Target Interaction Prediction","date":"2020-05-01","arxiv_id":"2005.00397","repositories_listed":1,"syntology":null},{"url":"/paper/pointer-constrained-text-generation-via","slug":"pointer-constrained-text-generation-via","title":"POINTER: Constrained Progressive Text Generation via Insertion-based Generative Pre-training","date":"2020-05-01","arxiv_id":"2005.00558","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/pointer-constrained-text-generation-via#ran","syntology_url":"https://syntology.ai/paper/2005.00558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00558"}},"official":{"repos":["dreasysnail/POINTER"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/segabert-pre-training-of-segment-aware-bert","slug":"segabert-pre-training-of-segment-aware-bert","title":"Segatron: Segment-Aware Transformer for Language Modeling and Understanding","date":"2020-04-30","arxiv_id":"2004.14996","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","repositories_listed":1,"syntology":null},{"url":"/paper/an-auto-encoder-strategy-for-adaptive-image","slug":"an-auto-encoder-strategy-for-adaptive-image","title":"An Auto-Encoder Strategy for Adaptive Image Segmentation","date":"2020-04-29","arxiv_id":"2004.13903","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-learning-with-graph-based","slug":"deep-reinforcement-learning-with-graph-based","title":"Graph-based State Representation for Deep Reinforcement Learning","date":"2020-04-29","arxiv_id":"2004.13965","repositories_listed":1,"syntology":null},{"url":"/paper/on-detecting-hidden-third-party-web-trackers","slug":"on-detecting-hidden-third-party-web-trackers","title":"Wide-AdGraph: Detecting Ad Trackers with a Wide Dependency Chain Graph","date":"2020-04-29","arxiv_id":"2004.14826","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-sample-representation-learning-for","slug":"out-of-sample-representation-learning-for","title":"Out-of-Sample Representation Learning for Multi-Relational Graphs","date":"2020-04-28","arxiv_id":"2004.13230","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-importance-of-word-and-sentence","slug":"on-the-importance-of-word-and-sentence","title":"On the Importance of Word and Sentence Representation Learning in Implicit Discourse Relation Classification","date":"2020-04-27","arxiv_id":"2004.12617","repositories_listed":1,"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/on-the-importance-of-word-and-sentence#ran","syntology_url":"https://syntology.ai/paper/2004.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12617"}},"official":{"repos":["HKUST-KnowComp/BMGF-RoBERTa"],"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/beyond-512-tokens-siamese-multi-depth","slug":"beyond-512-tokens-siamese-multi-depth","title":"Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching","date":"2020-04-26","arxiv_id":"2004.12297","repositories_listed":1,"syntology":null},{"url":"/paper/extending-and-analyzing-self-supervised","slug":"extending-and-analyzing-self-supervised","title":"Extending and Analyzing Self-Supervised Learning Across Domains","date":"2020-04-24","arxiv_id":"2004.11992","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-class-incremental-learning","slug":"few-shot-class-incremental-learning","title":"Few-Shot Class-Incremental Learning","date":"2020-04-23","arxiv_id":"2004.10956","repositories_listed":1,"syntology":null},{"url":"/paper/moltrans-molecular-interaction-transformer","slug":"moltrans-molecular-interaction-transformer","title":"MolTrans: Molecular Interaction Transformer for Drug Target Interaction Prediction","date":"2020-04-23","arxiv_id":"2004.11424","repositories_listed":1,"syntology":null},{"url":"/paper/pai-gcn-permutable-anisotropic-graph","slug":"pai-gcn-permutable-anisotropic-graph","title":"Learning Local Neighboring Structure for Robust 3D Shape Representation","date":"2020-04-21","arxiv_id":"2004.09995","repositories_listed":1,"syntology":null},{"url":"/paper/compositionality-and-generalization-in","slug":"compositionality-and-generalization-in","title":"Compositionality and Generalization in Emergent Languages","date":"2020-04-20","arxiv_id":"2004.09124","repositories_listed":1,"syntology":null},{"url":"/paper/detailed-2d-3d-joint-representation-for-human","slug":"detailed-2d-3d-joint-representation-for-human","title":"Detailed 2D-3D Joint Representation for Human-Object Interaction","date":"2020-04-17","arxiv_id":"2004.08154","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/detailed-2d-3d-joint-representation-for-human#ran","syntology_url":"https://syntology.ai/paper/2004.08154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08154"}},"official":{"repos":["DirtyHarryLYL/DJ-RN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-multi-resolution-representation","slug":"simple-multi-resolution-representation","title":"Simple Multi-Resolution Representation Learning for Human Pose Estimation","date":"2020-04-14","arxiv_id":"2004.06366","repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-global-and-local-representations","slug":"decoupling-global-and-local-representations","title":"Decoupling Global and Local Representations via Invertible Generative Flows","date":"2020-04-12","arxiv_id":"2004.11820","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-flops-to-learn-efficient-sparse-1","slug":"minimizing-flops-to-learn-efficient-sparse-1","title":"Minimizing FLOPs to Learn Efficient Sparse Representations","date":"2020-04-12","arxiv_id":"2004.05665","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/minimizing-flops-to-learn-efficient-sparse-1#ran","syntology_url":"https://syntology.ai/paper/2004.05665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05665"}},"official":{"repos":["biswajitsc/sparse-embed"],"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/depthwise-discrete-representation-learning","slug":"depthwise-discrete-representation-learning","title":"Depthwise Discrete Representation Learning","date":"2020-04-11","arxiv_id":"2004.05462","repositories_listed":1,"syntology":null},{"url":"/paper/exemplar-vaes-for-exemplar-based-generation","slug":"exemplar-vaes-for-exemplar-based-generation","title":"Exemplar VAE: Linking Generative Models, Nearest Neighbor Retrieval, and Data Augmentation","date":"2020-04-09","arxiv_id":"2004.04795","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exemplar-vaes-for-exemplar-based-generation#ran","syntology_url":"https://syntology.ai/paper/2004.04795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04795"}},"official":{"repos":["sajadn/Exemplar-VAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/autoencoders-for-unsupervised-anomaly","slug":"autoencoders-for-unsupervised-anomaly","title":"Autoencoders for Unsupervised Anomaly Segmentation in Brain MR Images: A Comparative Study","date":"2020-04-07","arxiv_id":"2004.03271","repositories_listed":1,"syntology":null},{"url":"/paper/patchvae-learning-local-latent-codes-for","slug":"patchvae-learning-local-latent-codes-for","title":"PatchVAE: Learning Local Latent Codes for Recognition","date":"2020-04-07","arxiv_id":"2004.03623","repositories_listed":1,"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/patchvae-learning-local-latent-codes-for#ran","syntology_url":"https://syntology.ai/paper/2004.03623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03623"}},"official":{"repos":["kampta/PatchVAE"],"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/answering-complex-queries-in-knowledge-graphs","slug":"answering-complex-queries-in-knowledge-graphs","title":"Answering Complex Queries in Knowledge Graphs with Bidirectional Sequence Encoders","date":"2020-04-06","arxiv_id":"2004.02596","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/answering-complex-queries-in-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2004.02596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02596"}},"official":null}},{"url":"/paper/fairnn-conjoint-learning-of-fair","slug":"fairnn-conjoint-learning-of-fair","title":"FairNN- Conjoint Learning of Fair Representations for Fair Decisions","date":"2020-04-05","arxiv_id":"2004.02173","repositories_listed":1,"syntology":null},{"url":"/paper/optimus-organizing-sentences-via-pre-trained","slug":"optimus-organizing-sentences-via-pre-trained","title":"Optimus: Organizing Sentences via Pre-trained Modeling of a Latent Space","date":"2020-04-05","arxiv_id":"2004.04092","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-via-ladder","slug":"graph-representation-learning-via-ladder","title":"Graph Representation Learning via Ladder Gamma Variational Autoencoders","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/infomax-neural-joint-source-channel-coding","slug":"infomax-neural-joint-source-channel-coding","title":"Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip","date":"2020-04-03","arxiv_id":"2004.01454","repositories_listed":1,"syntology":null}],"record_sha256":"2f30f9b62b5e7e18595fc18b0e5133f255c7589cf134ed3780d9bf7023ed169e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}