{"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/8","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":8,"pages_in_order":106,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/representation-learning/papers/9","papers":[{"url":"/paper/the-visual-task-adaptation-benchmark","slug":"the-visual-task-adaptation-benchmark","title":"A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmark","date":"2019-10-01","arxiv_id":"1910.04867","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-visual-task-adaptation-benchmark#ran","syntology_url":"https://syntology.ai/paper/1910.04867","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04867"}},"official":{"repos":["google-research/task_adaptation"],"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/identifying-through-flows-for-recovering","slug":"identifying-through-flows-for-recovering","title":"Identifying through Flows for Recovering Latent Representations","date":"2019-09-27","arxiv_id":"1909.12555","repositories_listed":2,"syntology":null},{"url":"/paper/rgbd-gan-unsupervised-3d-representation-1","slug":"rgbd-gan-unsupervised-3d-representation-1","title":"RGBD-GAN: Unsupervised 3D Representation Learning From Natural Image Datasets via RGBD Image Synthesis","date":"2019-09-27","arxiv_id":"1909.12573","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rgbd-gan-unsupervised-3d-representation-1#ran","syntology_url":"https://syntology.ai/paper/1909.12573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12573"}},"official":null}},{"url":"/paper/disco-physics-based-unsupervised-discovery-of","slug":"disco-physics-based-unsupervised-discovery-of","title":"DisCo: Physics-Based Unsupervised Discovery of Coherent Structures in Spatiotemporal Systems","date":"2019-09-25","arxiv_id":"1909.11822","repositories_listed":2,"syntology":null},{"url":"/paper/revealing-the-importance-of-semantic","slug":"revealing-the-importance-of-semantic","title":"Revealing the Importance of Semantic Retrieval for Machine Reading at Scale","date":"2019-09-17","arxiv_id":"1909.08041","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/revealing-the-importance-of-semantic#ran","syntology_url":"https://syntology.ai/paper/1909.08041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08041"}},"official":{"repos":["easonnie/semanticRetrievalMRS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/acfm-a-dynamic-spatial-temporal-network-for","slug":"acfm-a-dynamic-spatial-temporal-network-for","title":"Dynamic Spatial-Temporal Representation Learning for Traffic Flow Prediction","date":"2019-09-02","arxiv_id":"1909.02902","repositories_listed":2,"syntology":null},{"url":"/paper/facial-age-estimation-by-deep-residual","slug":"facial-age-estimation-by-deep-residual","title":"Facial age estimation by deep residual decision making","date":"2019-08-28","arxiv_id":"1908.10737","repositories_listed":2,"syntology":null},{"url":"/paper/variational-graph-recurrent-neural-networks","slug":"variational-graph-recurrent-neural-networks","title":"Variational Graph Recurrent Neural Networks","date":"2019-08-26","arxiv_id":"1908.09710","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variational-graph-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1908.09710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09710"}},"official":{"repos":["VGraphRNN/VGRNN"],"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/dynamics-aware-embeddings","slug":"dynamics-aware-embeddings","title":"Dynamics-aware Embeddings","date":"2019-08-25","arxiv_id":"1908.09357","repositories_listed":2,"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/dynamics-aware-embeddings#ran","syntology_url":"https://syntology.ai/paper/1908.09357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09357"}},"official":{"repos":["dyne-submission/dynamics-aware-embeddings"],"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/learning-semantic-specific-graph","slug":"learning-semantic-specific-graph","title":"Learning Semantic-Specific Graph Representation for Multi-Label Image Recognition","date":"2019-08-20","arxiv_id":"1908.07325","repositories_listed":2,"syntology":null},{"url":"/paper/taper-time-aware-patient-ehr-representation","slug":"taper-time-aware-patient-ehr-representation","title":"TAPER: Time-Aware Patient EHR Representation","date":"2019-08-11","arxiv_id":"1908.03971","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/taper-time-aware-patient-ehr-representation#ran","syntology_url":"https://syntology.ai/paper/1908.03971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03971"}},"official":{"repos":["sajaddarabi/TAPER","sajaddarabi/TAPER-EHR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-dynamic-embedding-trajectory-in","slug":"predicting-dynamic-embedding-trajectory-in","title":"Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks","date":"2019-08-03","arxiv_id":"1908.01207","repositories_listed":2,"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/predicting-dynamic-embedding-trajectory-in#ran","syntology_url":"https://syntology.ai/paper/1908.01207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.01207"}},"official":null}},{"url":"/paper/learning-lightweight-lane-detection-cnns-by","slug":"learning-lightweight-lane-detection-cnns-by","title":"Learning Lightweight Lane Detection CNNs by Self Attention Distillation","date":"2019-08-02","arxiv_id":"1908.00821","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-lightweight-lane-detection-cnns-by#ran","syntology_url":"https://syntology.ai/paper/1908.00821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00821"}},"official":{"repos":["cardwing/Codes-for-Lane-Detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-mutual-information-maximization-for","slug":"on-mutual-information-maximization-for","title":"On Mutual Information Maximization for Representation Learning","date":"2019-07-31","arxiv_id":"1907.13625","repositories_listed":2,"syntology":null},{"url":"/paper/genesis-generative-scene-inference-and","slug":"genesis-generative-scene-inference-and","title":"GENESIS: Generative Scene Inference and Sampling with Object-Centric Latent Representations","date":"2019-07-30","arxiv_id":"1907.13052","repositories_listed":2,"syntology":null},{"url":"/paper/isonn-isomorphic-neural-network-for-graph","slug":"isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","arxiv_id":"1907.09495","repositories_listed":2,"syntology":null},{"url":"/paper/vgraph-a-generative-model-for-joint-community","slug":"vgraph-a-generative-model-for-joint-community","title":"vGraph: A Generative Model for Joint Community Detection and Node Representation Learning","date":"2019-06-18","arxiv_id":"1906.07159","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vgraph-a-generative-model-for-joint-community#ran","syntology_url":"https://syntology.ai/paper/1906.07159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.07159"}},"official":null}},{"url":"/paper/graph-convolutional-transformer-learning-the","slug":"graph-convolutional-transformer-learning-the","title":"Learning the Graphical Structure of Electronic Health Records with Graph Convolutional Transformer","date":"2019-06-11","arxiv_id":"1906.04716","repositories_listed":2,"syntology":null},{"url":"/paper/data-to-text-generation-with-entity-modeling","slug":"data-to-text-generation-with-entity-modeling","title":"Data-to-text Generation with Entity Modeling","date":"2019-06-07","arxiv_id":"1906.03221","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-to-text-generation-with-entity-modeling#ran","syntology_url":"https://syntology.ai/paper/1906.03221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03221"}},"official":{"repos":["ratishsp/data2text-entity-py"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-adversarial-social-recommendation","slug":"deep-adversarial-social-recommendation","title":"Deep Adversarial Social Recommendation","date":"2019-05-30","arxiv_id":"1905.13160","repositories_listed":2,"syntology":null},{"url":"/paper/combating-label-noise-in-deep-learning-using","slug":"combating-label-noise-in-deep-learning-using","title":"Combating Label Noise in Deep Learning Using Abstention","date":"2019-05-27","arxiv_id":"1905.10964","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/combating-label-noise-in-deep-learning-using#ran","syntology_url":"https://syntology.ai/paper/1905.10964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10964"}},"official":{"repos":["thulas/dac-label-noise"],"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/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","repositories_listed":2,"syntology":null},{"url":"/paper/neural-3d-morphable-models-spiral","slug":"neural-3d-morphable-models-spiral","title":"Neural 3D Morphable Models: Spiral Convolutional Networks for 3D Shape Representation Learning and Generation","date":"2019-05-08","arxiv_id":"1905.02876","repositories_listed":2,"syntology":null},{"url":"/paper/scaling-and-benchmarking-self-supervised","slug":"scaling-and-benchmarking-self-supervised","title":"Scaling and Benchmarking Self-Supervised Visual Representation Learning","date":"2019-05-03","arxiv_id":"1905.01235","repositories_listed":2,"syntology":null},{"url":"/paper/dyrep-learning-representations-over-dynamic","slug":"dyrep-learning-representations-over-dynamic","title":"DyRep: Learning Representations over Dynamic Graphs","date":"2019-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/ib-gan-disentangled-representation-learning","slug":"ib-gan-disentangled-representation-learning","title":"IB-GAN: Disentangled Representation Learning with Information Bottleneck GAN","date":"2019-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-balancing-based-representation","slug":"adversarial-balancing-based-representation","title":"Adversarial Balancing-based Representation Learning for Causal Effect Inference with Observational Data","date":"2019-04-30","arxiv_id":"1904.13335","repositories_listed":2,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/adversarial-balancing-based-representation#ran","syntology_url":"https://syntology.ai/paper/1904.13335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13335"}},"official":{"repos":["octeufer/Adversarial-Balancing-based-representation-learning-for-Causal-Effect-Inference"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/surprising-effectiveness-of-few-image","slug":"surprising-effectiveness-of-few-image","title":"A critical analysis of self-supervision, or what we can learn from a single image","date":"2019-04-30","arxiv_id":"1904.13132","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/surprising-effectiveness-of-few-image#ran","syntology_url":"https://syntology.ai/paper/1904.13132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13132"}},"official":{"repos":["yukimasano/linear-probes"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/temporal-cycle-consistency-learning","slug":"temporal-cycle-consistency-learning","title":"Temporal Cycle-Consistency Learning","date":"2019-04-16","arxiv_id":"1904.07846","repositories_listed":2,"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/temporal-cycle-consistency-learning#ran","syntology_url":"https://syntology.ai/paper/1904.07846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.07846"}},"official":null}},{"url":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","repositories_listed":2,"syntology":null},{"url":"/paper/on-learning-invariant-representation-for","slug":"on-learning-invariant-representation-for","title":"On Learning Invariant Representation for Domain Adaptation","date":"2019-01-27","arxiv_id":"1901.09453","repositories_listed":2,"syntology":null},{"url":"/paper/loss-landscapes-of-regularized-linear","slug":"loss-landscapes-of-regularized-linear","title":"Loss Landscapes of Regularized Linear Autoencoders","date":"2019-01-23","arxiv_id":"1901.08168","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/loss-landscapes-of-regularized-linear#ran","syntology_url":"https://syntology.ai/paper/1901.08168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08168"}},"official":{"repos":["danielkunin/Regularized-Linear-Autoencoders"],"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/deepcf-a-unified-framework-of-representation","slug":"deepcf-a-unified-framework-of-representation","title":"DeepCF: A Unified Framework of Representation Learning and Matching Function Learning in Recommender System","date":"2019-01-15","arxiv_id":"1901.04704","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-representation-learning-a","slug":"knowledge-representation-learning-a","title":"Knowledge Representation Learning: A Quantitative Review","date":"2018-12-28","arxiv_id":"1812.10901","repositories_listed":2,"syntology":null},{"url":"/paper/let-me-not-lie-learning-multinomial-logit","slug":"let-me-not-lie-learning-multinomial-logit","title":"Enhancing Discrete Choice Models with Representation Learning","date":"2018-12-23","arxiv_id":"1812.09747","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-graph-representation-learning-via","slug":"dynamic-graph-representation-learning-via","title":"Dynamic Graph Representation Learning via Self-Attention Networks","date":"2018-12-22","arxiv_id":"1812.09430","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-of-compositional-data","slug":"representation-learning-of-compositional-data","title":"Representation Learning of Compositional Data","date":"2018-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-node-feature-convolution-for","slug":"graph-node-feature-convolution-for","title":"Graph Node-Feature Convolution for Representation Learning","date":"2018-11-30","arxiv_id":"1812.00086","repositories_listed":2,"syntology":null},{"url":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","repositories_listed":2,"syntology":null},{"url":"/paper/binarized-attributed-network-embedding","slug":"binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-autoencoder-like-nonnegative-matrix","slug":"deep-autoencoder-like-nonnegative-matrix","title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/neural-symbolic-vqa-disentangling-reasoning","slug":"neural-symbolic-vqa-disentangling-reasoning","title":"Neural-Symbolic VQA: Disentangling Reasoning from Vision and Language Understanding","date":"2018-10-04","arxiv_id":"1810.02338","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-symbolic-vqa-disentangling-reasoning#ran","syntology_url":"https://syntology.ai/paper/1810.02338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.02338"}},"official":null}},{"url":"/paper/semi-supervised-sequence-modeling-with-cross","slug":"semi-supervised-sequence-modeling-with-cross","title":"Semi-Supervised Sequence Modeling with Cross-View Training","date":"2018-09-22","arxiv_id":"1809.08370","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","repositories_listed":2,"syntology":null},{"url":"/paper/open-domain-question-answering-using-early","slug":"open-domain-question-answering-using-early","title":"Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text","date":"2018-09-04","arxiv_id":"1809.00782","repositories_listed":2,"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/open-domain-question-answering-using-early#ran","syntology_url":"https://syntology.ai/paper/1809.00782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00782"}},"official":{"repos":["OceanskySun/GraftNet"],"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/segmentation-free-compositional-n-gram","slug":"segmentation-free-compositional-n-gram","title":"Segmentation-free Compositional $n$-gram Embedding","date":"2018-09-04","arxiv_id":"1809.00918","repositories_listed":2,"syntology":null},{"url":"/paper/context-movers-distance-barycenters-optimal","slug":"context-movers-distance-barycenters-optimal","title":"Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations","date":"2018-08-29","arxiv_id":"1808.09663","repositories_listed":2,"syntology":null},{"url":"/paper/multi-level-network-embedding-with-boosted","slug":"multi-level-network-embedding-with-boosted","title":"Multi-Level Network Embedding with Boosted Low-Rank Matrix Approximation","date":"2018-08-26","arxiv_id":"1808.08627","repositories_listed":2,"syntology":null},{"url":"/paper/visual-reinforcement-learning-with-imagined","slug":"visual-reinforcement-learning-with-imagined","title":"Visual Reinforcement Learning with Imagined Goals","date":"2018-07-12","arxiv_id":"1807.04742","repositories_listed":2,"syntology":null},{"url":"/paper/automated-vulnerability-detection-in-source","slug":"automated-vulnerability-detection-in-source","title":"Automated Vulnerability Detection in Source Code Using Deep Representation Learning","date":"2018-07-11","arxiv_id":"1807.04320","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-path-integral-autoencoder","slug":"adaptive-path-integral-autoencoder","title":"Adaptive Path-Integral Autoencoder: Representation Learning and Planning for Dynamical Systems","date":"2018-07-05","arxiv_id":"1807.02128","repositories_listed":2,"syntology":null},{"url":"/paper/variational-wasserstein-clustering","slug":"variational-wasserstein-clustering","title":"Variational Wasserstein Clustering","date":"2018-06-23","arxiv_id":"1806.09045","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-wasserstein-clustering#ran","syntology_url":"https://syntology.ai/paper/1806.09045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09045"}},"official":{"repos":["icemiliang/vot"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-factorized-multimodal","slug":"learning-factorized-multimodal","title":"Learning Factorized Multimodal Representations","date":"2018-06-16","arxiv_id":"1806.06176","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-of-entities-and","slug":"representation-learning-of-entities-and","title":"Representation Learning of Entities and Documents from Knowledge Base Descriptions","date":"2018-06-08","arxiv_id":"1806.02960","repositories_listed":2,"syntology":null},{"url":"/paper/spectral-inference-networks-unifying-spectral","slug":"spectral-inference-networks-unifying-spectral","title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","date":"2018-06-06","arxiv_id":"1806.02215","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spectral-inference-networks-unifying-spectral#ran","syntology_url":"https://syntology.ai/paper/1806.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02215"}},"official":{"repos":["deepmind/spectral_inference_networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-attentions-residual-attentional","slug":"learning-attentions-residual-attentional","title":"Learning Attentions: Residual Attentional Siamese Network for High Performance Online Visual Tracking","date":"2018-06-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/sopa-bridging-cnns-rnns-and-weighted-finite","slug":"sopa-bridging-cnns-rnns-and-weighted-finite","title":"SoPa: Bridging CNNs, RNNs, and Weighted Finite-State Machines","date":"2018-05-15","arxiv_id":"1805.06061","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sopa-bridging-cnns-rnns-and-weighted-finite#ran","syntology_url":"https://syntology.ai/paper/1805.06061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06061"}},"official":{"repos":["Noahs-ARK/soft_patterns"],"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/sampling-strategies-in-siamese-networks-for","slug":"sampling-strategies-in-siamese-networks-for","title":"Sampling strategies in Siamese Networks for unsupervised speech representation learning","date":"2018-04-30","arxiv_id":"1804.11297","repositories_listed":2,"syntology":null},{"url":"/paper/multi-focus-noisy-image-fusion-using-low-rank","slug":"multi-focus-noisy-image-fusion-using-low-rank","title":"Multi-focus Noisy Image Fusion using Low-Rank Representation","date":"2018-04-25","arxiv_id":"1804.09325","repositories_listed":2,"syntology":null},{"url":"/paper/multi-focus-image-fusion-using-dictionary","slug":"multi-focus-image-fusion-using-dictionary","title":"Multi-focus Image Fusion using dictionary learning and Low-Rank Representation","date":"2018-04-23","arxiv_id":"1804.08355","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-discrete-sentence-representation","slug":"unsupervised-discrete-sentence-representation","title":"Unsupervised Discrete Sentence Representation Learning for Interpretable Neural Dialog Generation","date":"2018-04-22","arxiv_id":"1804.08069","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-discrete-sentence-representation#ran","syntology_url":"https://syntology.ai/paper/1804.08069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.08069"}},"official":{"repos":["snakeztc/NeuralDialog-LAED"],"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":["listed","official"]}}},{"url":"/paper/meta-learning-update-rules-for-unsupervised","slug":"meta-learning-update-rules-for-unsupervised","title":"Meta-Learning Update Rules for Unsupervised Representation Learning","date":"2018-03-31","arxiv_id":"1804.00222","repositories_listed":2,"syntology":null},{"url":"/paper/branchgan-branched-generative-adversarial","slug":"branchgan-branched-generative-adversarial","title":"BSD-GAN: Branched Generative Adversarial Network for Scale-Disentangled Representation Learning and Image Synthesis","date":"2018-03-22","arxiv_id":"1803.08467","repositories_listed":2,"syntology":null},{"url":"/paper/inferencing-based-on-unsupervised-learning-of","slug":"inferencing-based-on-unsupervised-learning-of","title":"Inferencing Based on Unsupervised Learning of Disentangled Representations","date":"2018-03-07","arxiv_id":"1803.02627","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-make-predictions-on-graphs-with","slug":"learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","arxiv_id":"1802.08352","repositories_listed":2,"syntology":null},{"url":"/paper/generalization-in-machine-learning-via","slug":"generalization-in-machine-learning-via","title":"Generalization in Machine Learning via Analytical Learning Theory","date":"2018-02-21","arxiv_id":"1802.07426","repositories_listed":2,"syntology":null},{"url":"/paper/tvae-triplet-based-variational-autoencoder","slug":"tvae-triplet-based-variational-autoencoder","title":"TVAE: Triplet-Based Variational Autoencoder using Metric Learning","date":"2018-02-13","arxiv_id":"1802.04403","repositories_listed":2,"syntology":null},{"url":"/paper/multi-pointer-co-attention-networks-for","slug":"multi-pointer-co-attention-networks-for","title":"Multi-Pointer Co-Attention Networks for Recommendation","date":"2018-01-28","arxiv_id":"1801.09251","repositories_listed":2,"syntology":null},{"url":"/paper/ai2-thor-an-interactive-3d-environment-for","slug":"ai2-thor-an-interactive-3d-environment-for","title":"AI2-THOR: An Interactive 3D Environment for Visual AI","date":"2017-12-14","arxiv_id":"1712.05474","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai2-thor-an-interactive-3d-environment-for#ran","syntology_url":"https://syntology.ai/paper/1712.05474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.05474"}},"official":{"repos":["allenai/ai2thor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-spatiotemporal-feature-learning","slug":"rethinking-spatiotemporal-feature-learning","title":"Rethinking Spatiotemporal Feature Learning: Speed-Accuracy Trade-offs in Video Classification","date":"2017-12-13","arxiv_id":"1712.04851","repositories_listed":2,"syntology":null},{"url":"/paper/joint-representation-learning-for-top-n","slug":"joint-representation-learning-for-top-n","title":"Joint Representation Learning for Top-N Recommendation with Heterogeneous Information Sources","date":"2017-11-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/how-much-chemistry-does-a-deep-neural-network","slug":"how-much-chemistry-does-a-deep-neural-network","title":"How Much Chemistry Does a Deep Neural Network Need to Know to Make Accurate Predictions?","date":"2017-10-05","arxiv_id":"1710.02238","repositories_listed":2,"syntology":null},{"url":"/paper/kblrn-end-to-end-learning-of-knowledge-base","slug":"kblrn-end-to-end-learning-of-knowledge-base","title":"KBLRN : End-to-End Learning of Knowledge Base Representations with Latent, Relational, and Numerical Features","date":"2017-09-14","arxiv_id":"1709.04676","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-for-visual-relational","slug":"representation-learning-for-visual-relational","title":"Answering Visual-Relational Queries in Web-Extracted Knowledge Graphs","date":"2017-09-07","arxiv_id":"1709.02314","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-by-learning-to-count","slug":"representation-learning-by-learning-to-count","title":"Representation Learning by Learning to Count","date":"2017-08-22","arxiv_id":"1708.06734","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-by-learning-to-count#ran","syntology_url":"https://syntology.ai/paper/1708.06734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.06734"}},"official":null}},{"url":"/paper/revisiting-unreasonable-effectiveness-of-data","slug":"revisiting-unreasonable-effectiveness-of-data","title":"Revisiting Unreasonable Effectiveness of Data in Deep Learning Era","date":"2017-07-10","arxiv_id":"1707.02968","repositories_listed":2,"syntology":null},{"url":"/paper/a-simple-approach-to-learn-polysemous-word","slug":"a-simple-approach-to-learn-polysemous-word","title":"A Simple Approach to Learn Polysemous Word Embeddings","date":"2017-07-06","arxiv_id":"1707.01793","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-word-embeddings-for-evolving-semantic","slug":"dynamic-word-embeddings-for-evolving-semantic","title":"Dynamic Word Embeddings for Evolving Semantic Discovery","date":"2017-03-02","arxiv_id":"1703.00607","repositories_listed":2,"syntology":null},{"url":"/paper/visual-translation-embedding-network-for","slug":"visual-translation-embedding-network-for","title":"Visual Translation Embedding Network for Visual Relation Detection","date":"2017-02-27","arxiv_id":"1702.08319","repositories_listed":2,"syntology":null},{"url":"/paper/font-size-community-preserving-network","slug":"font-size-community-preserving-network","title":"Font Size: Community Preserving Network Embedding","date":"2017-02-10","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/name-disambiguation-in-anonymized-graphs","slug":"name-disambiguation-in-anonymized-graphs","title":"Name Disambiguation in Anonymized Graphs using Network Embedding","date":"2017-02-08","arxiv_id":"1702.02287","repositories_listed":2,"syntology":null},{"url":"/paper/hashnet-deep-learning-to-hash-by-continuation","slug":"hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","arxiv_id":"1702.00758","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hashnet-deep-learning-to-hash-by-continuation#ran","syntology_url":"https://syntology.ai/paper/1702.00758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.00758"}},"official":{"repos":["thuml/HashNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/linear-disentangled-representation-learning","slug":"linear-disentangled-representation-learning","title":"Linear Disentangled Representation Learning for Facial Actions","date":"2017-01-11","arxiv_id":"1701.03102","repositories_listed":2,"syntology":null},{"url":"/paper/split-brain-autoencoders-unsupervised","slug":"split-brain-autoencoders-unsupervised","title":"Split-Brain Autoencoders: Unsupervised Learning by Cross-Channel Prediction","date":"2016-11-29","arxiv_id":"1611.09842","repositories_listed":2,"syntology":null},{"url":"/paper/deep-temporal-linear-encoding-networks","slug":"deep-temporal-linear-encoding-networks","title":"Deep Temporal Linear Encoding Networks","date":"2016-11-21","arxiv_id":"1611.06678","repositories_listed":2,"syntology":null},{"url":"/paper/neural-structural-correspondence-learning-for","slug":"neural-structural-correspondence-learning-for","title":"Neural Structural Correspondence Learning for Domain Adaptation","date":"2016-10-05","arxiv_id":"1610.01588","repositories_listed":2,"syntology":null},{"url":"/paper/deep-multi-task-representation-learning-a","slug":"deep-multi-task-representation-learning-a","title":"Deep Multi-task Representation Learning: A Tensor Factorisation Approach","date":"2016-05-20","arxiv_id":"1605.06391","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-multi-task-representation-learning-a#ran","syntology_url":"https://syntology.ai/paper/1605.06391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.06391"}},"official":{"repos":["wOOL/DMTRL"],"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/multi-layer-representation-learning-for","slug":"multi-layer-representation-learning-for","title":"Multi-layer Representation Learning for Medical Concepts","date":"2016-02-17","arxiv_id":"1602.05568","repositories_listed":2,"syntology":null},{"url":"/paper/correlational-neural-networks","slug":"correlational-neural-networks","title":"Correlational Neural Networks","date":"2015-04-27","arxiv_id":"1504.07225","repositories_listed":2,"syntology":null},{"url":"/paper/dual-dimensions-geometric-representation","slug":"dual-dimensions-geometric-representation","title":"Dual Dimensions Geometric Representation Learning Based Document Dewarping","date":"2025-07-11","arxiv_id":"2507.08492","repositories_listed":1,"syntology":null},{"url":"/paper/feed-forward-scenedino-for-unsupervised","slug":"feed-forward-scenedino-for-unsupervised","title":"Feed-Forward SceneDINO for Unsupervised Semantic Scene Completion","date":"2025-07-08","arxiv_id":"2507.06230","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-one-shot-beyond-one-perspective-cross","slug":"beyond-one-shot-beyond-one-perspective-cross","title":"Beyond One Shot, Beyond One Perspective: Cross-View and Long-Horizon Distillation for Better LiDAR Representations","date":"2025-07-07","arxiv_id":"2507.05260","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-machine-learning-using-euler","slug":"molecular-machine-learning-using-euler","title":"Molecular Machine Learning Using Euler Characteristic Transforms","date":"2025-07-04","arxiv_id":"2507.03474","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/molecular-machine-learning-using-euler#ran","syntology_url":"https://syntology.ai/paper/2507.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.03474"}},"official":{"repos":["victosdur/ectformoleculelearningtask"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-thermodynamic-flows-unified","slug":"latent-thermodynamic-flows-unified","title":"Latent Thermodynamic Flows: Unified Representation Learning and Generative Modeling of Temperature-Dependent Behaviors from Limited Data","date":"2025-07-03","arxiv_id":"2507.03174","repositories_listed":1,"syntology":null},{"url":"/paper/following-the-clues-experiments-on-person-re","slug":"following-the-clues-experiments-on-person-re","title":"Following the Clues: Experiments on Person Re-ID using Cross-Modal Intelligence","date":"2025-07-02","arxiv_id":"2507.01504","repositories_listed":1,"syntology":null},{"url":"/paper/when-does-pruning-benefit-vision","slug":"when-does-pruning-benefit-vision","title":"When Does Pruning Benefit Vision Representations?","date":"2025-07-02","arxiv_id":"2507.01722","repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-dual-self-distillation-for-3d-self","slug":"asymmetric-dual-self-distillation-for-3d-self","title":"Asymmetric Dual Self-Distillation for 3D Self-Supervised Representation Learning","date":"2025-06-26","arxiv_id":"2506.21724","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-sub-action-tree-for-continuous","slug":"hierarchical-sub-action-tree-for-continuous","title":"Hierarchical Sub-action Tree for Continuous Sign Language Recognition","date":"2025-06-26","arxiv_id":"2506.20947","repositories_listed":1,"syntology":null},{"url":"/paper/kalm-embedding-v2-superior-training","slug":"kalm-embedding-v2-superior-training","title":"KaLM-Embedding-V2: Superior Training Techniques and Data Inspire A Versatile Embedding Model","date":"2025-06-26","arxiv_id":"2506.20923","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-representations-of-microscopy","slug":"disentangled-representations-of-microscopy","title":"Disentangled representations of microscopy images","date":"2025-06-25","arxiv_id":"2506.20649","repositories_listed":1,"syntology":null}],"record_sha256":"c22dd3be7150e77490f5a972014be787cd9905103f7f8b14ac848583647750b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}