{"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/inductive-bias/papers/7","list_of":"/task/inductive-bias","task":"Inductive Bias","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":7,"pages_in_order":16,"rows_per_page":100,"rows":[601,700],"of":1529,"counts":{"archive_papers_tagged":1529,"with_a_code_link":716,"where_syntology_ran_a_sample":284,"not_listed_spam_title":0,"listed":1529,"listed_where_code_ran":284,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":244,"every_run_a_failure_of_syntologys_instrument":40,"listed_with_a_run_with_no_instrument_failure":244,"listed_every_run_a_failure_of_syntologys_instrument":40,"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/inductive-bias","prev":"/task/inductive-bias/papers/6","next":"/task/inductive-bias/papers/8","papers":[{"url":"/paper/support-target-protocol-for-meta-learning","slug":"support-target-protocol-for-meta-learning","title":"Towards Enabling Meta-Learning from Target Models","date":"2021-04-08","arxiv_id":"2104.03736","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/support-target-protocol-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2104.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03736"}},"official":{"repos":["njulus/ST"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/new-benchmarks-for-learning-on-non","slug":"new-benchmarks-for-learning-on-non","title":"New Benchmarks for Learning on Non-Homophilous Graphs","date":"2021-04-03","arxiv_id":"2104.01404","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-relational-encoding-in-language","slug":"rethinking-relational-encoding-in-language","title":"Structure Inducing Pre-Training","date":"2021-03-18","arxiv_id":"2103.10334","repositories_listed":1,"syntology":null},{"url":"/paper/vdsm-unsupervised-video-disentanglement-with","slug":"vdsm-unsupervised-video-disentanglement-with","title":"VDSM: Unsupervised Video Disentanglement with State-Space Modeling and Deep Mixtures of Experts","date":"2021-03-12","arxiv_id":"2103.07292","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/vdsm-unsupervised-video-disentanglement-with#ran","syntology_url":"https://syntology.ai/paper/2103.07292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07292"}},"official":{"repos":["matthewvowels1/DisentanglingSequences"],"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/a-framework-for-measuring-compositional","slug":"a-framework-for-measuring-compositional","title":"Neural networks can understand compositional functions that humans do not, in the context of emergent communication","date":"2021-03-06","arxiv_id":"2103.04180","repositories_listed":1,"syntology":null},{"url":"/paper/attention-is-not-all-you-need-pure-attention","slug":"attention-is-not-all-you-need-pure-attention","title":"Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depth","date":"2021-03-05","arxiv_id":"2103.03404","repositories_listed":1,"syntology":null},{"url":"/paper/cotr-efficiently-bridging-cnn-and-transformer","slug":"cotr-efficiently-bridging-cnn-and-transformer","title":"CoTr: Efficiently Bridging CNN and Transformer for 3D Medical Image Segmentation","date":"2021-03-04","arxiv_id":"2103.03024","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-learning-for-scene-graph","slug":"energy-based-learning-for-scene-graph","title":"Energy-Based Learning for Scene Graph Generation","date":"2021-03-03","arxiv_id":"2103.02221","repositories_listed":1,"syntology":null},{"url":"/paper/learning-with-hyperspherical-uniformity","slug":"learning-with-hyperspherical-uniformity","title":"Learning with Hyperspherical Uniformity","date":"2021-03-02","arxiv_id":"2103.01649","repositories_listed":1,"syntology":null},{"url":"/paper/convolution-free-medical-image-segmentation","slug":"convolution-free-medical-image-segmentation","title":"Convolution-Free Medical Image Segmentation using Transformers","date":"2021-02-26","arxiv_id":"2102.13645","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-bias-of-multi-channel-linear","slug":"inductive-bias-of-multi-channel-linear","title":"Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm","date":"2021-02-24","arxiv_id":"2102.12238","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-neural-networks-for-inverse","slug":"equivariant-neural-networks-for-inverse","title":"Equivariant neural networks for inverse problems","date":"2021-02-23","arxiv_id":"2102.11504","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-content-and-style-exploring-bias-1","slug":"rethinking-content-and-style-exploring-bias-1","title":"Rethinking Content and Style: Exploring Bias for Unsupervised Disentanglement","date":"2021-02-21","arxiv_id":"2102.10544","repositories_listed":1,"syntology":null},{"url":"/paper/on-approximation-in-deep-convolutional","slug":"on-approximation-in-deep-convolutional","title":"Approximation and Learning with Deep Convolutional Models: a Kernel Perspective","date":"2021-02-19","arxiv_id":"2102.10032","repositories_listed":1,"syntology":null},{"url":"/paper/translational-equivariance-in-kernelizable","slug":"translational-equivariance-in-kernelizable","title":"Translational Equivariance in Kernelizable Attention","date":"2021-02-15","arxiv_id":"2102.07680","repositories_listed":1,"syntology":null},{"url":"/paper/a-differentiable-contact-model-to-extend","slug":"a-differentiable-contact-model-to-extend","title":"Extending Lagrangian and Hamiltonian Neural Networks with Differentiable Contact Models","date":"2021-02-12","arxiv_id":"2102.06794","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-generalization-for-predictive","slug":"systematic-generalization-for-predictive","title":"Systematic Generalization in Neural Networks-based Multivariate Time Series Forecasting Models","date":"2021-02-10","arxiv_id":"2102.05602","repositories_listed":1,"syntology":null},{"url":"/paper/video-reenactment-as-inductive-bias-for","slug":"video-reenactment-as-inductive-bias-for","title":"Video Reenactment as Inductive Bias for Content-Motion Disentanglement","date":"2021-01-30","arxiv_id":"2102.00324","repositories_listed":1,"syntology":null},{"url":"/paper/sstvos-sparse-spatiotemporal-transformers-for","slug":"sstvos-sparse-spatiotemporal-transformers-for","title":"SSTVOS: Sparse Spatiotemporal Transformers for Video Object Segmentation","date":"2021-01-21","arxiv_id":"2101.08833","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sstvos-sparse-spatiotemporal-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2101.08833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08833"}},"official":{"repos":["dukebw/SSTVOS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/directed-acyclic-graph-neural-networks-1","slug":"directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","arxiv_id":"2101.07965","repositories_listed":1,"syntology":null},{"url":"/paper/lime-learning-inductive-bias-for-primitives-1","slug":"lime-learning-inductive-bias-for-primitives-1","title":"LIME: Learning Inductive Bias for Primitives of Mathematical Reasoning","date":"2021-01-15","arxiv_id":"2101.06223","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lime-learning-inductive-bias-for-primitives-1#ran","syntology_url":"https://syntology.ai/paper/2101.06223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06223"}},"official":{"repos":["tonywu95/lime"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-vessel-enhancement-using-flow","slug":"self-supervised-vessel-enhancement-using-flow","title":"Self-Supervised Vessel Enhancement Using Flow-Based Consistencies","date":"2021-01-13","arxiv_id":"2101.05145","repositories_listed":1,"syntology":null},{"url":"/paper/of-non-linearity-and-commutativity-in-bert","slug":"of-non-linearity-and-commutativity-in-bert","title":"Of Non-Linearity and Commutativity in BERT","date":"2021-01-12","arxiv_id":"2101.04547","repositories_listed":1,"syntology":null},{"url":"/paper/explain-and-predict-and-then-predict-again","slug":"explain-and-predict-and-then-predict-again","title":"Explain and Predict, and then Predict Again","date":"2021-01-11","arxiv_id":"2101.04109","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-parsing-with-less-prior-and-more","slug":"semantic-parsing-with-less-prior-and-more","title":"Code Generation from Natural Language with Less Prior and More Monolingual Data","date":"2021-01-01","arxiv_id":"2101.00259","repositories_listed":1,"syntology":null},{"url":"/paper/communicative-message-passing-for-inductive","slug":"communicative-message-passing-for-inductive","title":"Communicative Message Passing for Inductive Relation Reasoning","date":"2020-12-16","arxiv_id":"2012.08911","repositories_listed":1,"syntology":null},{"url":"/paper/spatially-adaptive-pixelwise-networks-for","slug":"spatially-adaptive-pixelwise-networks-for","title":"Spatially-Adaptive Pixelwise Networks for Fast Image Translation","date":"2020-12-05","arxiv_id":"2012.02992","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-bias-and-language-expressivity-in","slug":"inductive-bias-and-language-expressivity-in","title":"Inductive Bias and Language Expressivity in Emergent Communication","date":"2020-12-04","arxiv_id":"2012.02875","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-bias-and-language-expressivity-in#ran","syntology_url":"https://syntology.ai/paper/2012.02875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02875"}},"official":{"repos":["Shawn-Guo-CN/GameBias-EmeCom2020"],"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/supercharging-imbalanced-data-learning-with","slug":"supercharging-imbalanced-data-learning-with","title":"Supercharging Imbalanced Data Learning With Energy-based Contrastive Representation Transfer","date":"2020-11-25","arxiv_id":"2011.12454","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-end-to-end-differentiable-natural","slug":"exploring-end-to-end-differentiable-natural","title":"Exploring End-to-End Differentiable Natural Logic Modeling","date":"2020-11-08","arxiv_id":"2011.04044","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-represent-action-values-as-a-1","slug":"learning-to-represent-action-values-as-a-1","title":"Learning to Represent Action Values as a Hypergraph on the Action Vertices","date":"2020-10-28","arxiv_id":"2010.14680","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-represent-action-values-as-a-1#ran","syntology_url":"https://syntology.ai/paper/2010.14680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14680"}},"official":{"repos":["atavakol/action-hypergraph-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-bias-of-gradient-descent-for-1","slug":"inductive-bias-of-gradient-descent-for-1","title":"Inductive Bias of Gradient Descent for Weight Normalized Smooth Homogeneous Neural Nets","date":"2020-10-24","arxiv_id":"2010.12909","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-norm-growth-during-training-of","slug":"parameter-norm-growth-during-training-of","title":"Effects of Parameter Norm Growth During Transformer Training: Inductive Bias from Gradient Descent","date":"2020-10-19","arxiv_id":"2010.09697","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-norm-growth-during-training-of#ran","syntology_url":"https://syntology.ai/paper/2010.09697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09697"}},"official":{"repos":["viking-sudo-rm/norm-growth"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-rnns-trained-on-harder-subject-verb","slug":"can-rnns-trained-on-harder-subject-verb","title":"Can RNNs trained on harder subject-verb agreement instances still perform well on easier ones?","date":"2020-10-10","arxiv_id":"2010.04976","repositories_listed":1,"syntology":null},{"url":"/paper/grappa-grammar-augmented-pre-training-for","slug":"grappa-grammar-augmented-pre-training-for","title":"GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing","date":"2020-09-29","arxiv_id":"2009.13845","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 1 unverified","sample_list":"/paper/grappa-grammar-augmented-pre-training-for#ran","syntology_url":"https://syntology.ai/paper/2009.13845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13845"}},"official":null}},{"url":"/paper/hierarchical-sparse-variational-autoencoder","slug":"hierarchical-sparse-variational-autoencoder","title":"Learning Sparse Sentence Encoding without Supervision: An Exploration of Sparsity in Variational Autoencoders","date":"2020-09-25","arxiv_id":"2009.12421","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-regions-graph-neural-networks-for","slug":"dynamic-regions-graph-neural-networks-for","title":"Discovering Dynamic Salient Regions for Spatio-Temporal Graph Neural Networks","date":"2020-09-17","arxiv_id":"2009.08427","repositories_listed":1,"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/dynamic-regions-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2009.08427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08427"}},"official":{"repos":["bit-ml/dyreg-gnn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/structured-attention-for-unsupervised","slug":"structured-attention-for-unsupervised","title":"Structured Attention for Unsupervised Dialogue Structure Induction","date":"2020-09-17","arxiv_id":"2009.08552","repositories_listed":1,"syntology":null},{"url":"/paper/prevalence-of-neural-collapse-during-the","slug":"prevalence-of-neural-collapse-during-the","title":"Prevalence of Neural Collapse during the terminal phase of deep learning training","date":"2020-08-18","arxiv_id":"2008.08186","repositories_listed":1,"syntology":null},{"url":"/paper/self-sampling-for-neural-point-cloud","slug":"self-sampling-for-neural-point-cloud","title":"Self-Sampling for Neural Point Cloud Consolidation","date":"2020-08-14","arxiv_id":"2008.06471","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/self-sampling-for-neural-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2008.06471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06471"}},"official":{"repos":["galmetzer/self-sample"],"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/towards-learning-convolutions-from-scratch","slug":"towards-learning-convolutions-from-scratch","title":"Towards Learning Convolutions from Scratch","date":"2020-07-27","arxiv_id":"2007.13657","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-graph-neural-network-for-few-shot","slug":"fuzzy-graph-neural-network-for-few-shot","title":"Fuzzy Graph Neural Network for Few-Shot Learning","date":"2020-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-match-distributions-for-domain","slug":"learning-to-match-distributions-for-domain","title":"Learning to Match Distributions for Domain Adaptation","date":"2020-07-17","arxiv_id":"2007.10791","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-plan-with-uncertain-topological","slug":"learning-to-plan-with-uncertain-topological","title":"Learning to plan with uncertain topological maps","date":"2020-07-10","arxiv_id":"2007.05270","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-plan-with-uncertain-topological#ran","syntology_url":"https://syntology.ai/paper/2007.05270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05270"}},"official":null}},{"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/group-equivariant-deep-reinforcement-learning","slug":"group-equivariant-deep-reinforcement-learning","title":"Group Equivariant Deep Reinforcement Learning","date":"2020-07-01","arxiv_id":"2007.03437","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/group-equivariant-deep-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2007.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03437"}},"official":{"repos":["arnab39/EquivariantDQN"],"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/latent-compositional-representations-improve","slug":"latent-compositional-representations-improve","title":"Latent Compositional Representations Improve Systematic Generalization in Grounded Question Answering","date":"2020-07-01","arxiv_id":"2007.00266","repositories_listed":1,"syntology":null},{"url":"/paper/building-powerful-and-equivariant-graph","slug":"building-powerful-and-equivariant-graph","title":"Building powerful and equivariant graph neural networks with structural message-passing","date":"2020-06-26","arxiv_id":"2006.15107","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-mechanics-of-generalization-in","slug":"statistical-mechanics-of-generalization-in","title":"Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks","date":"2020-06-23","arxiv_id":"2006.13198","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/statistical-mechanics-of-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2006.13198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13198"}},"official":{"repos":["Pehlevan-Group/kernel-generalization"],"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/improving-image-captioning-with-better-use-of-1","slug":"improving-image-captioning-with-better-use-of-1","title":"Improving Image Captioning with Better Use of Captions","date":"2020-06-21","arxiv_id":"2006.11807","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-image-captioning-with-better-use-of-1#ran","syntology_url":"https://syntology.ai/paper/2006.11807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11807"}},"official":{"repos":["Gitsamshi/WeakVRD-Captioning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/categorical-normalizing-flows-via-continuous","slug":"categorical-normalizing-flows-via-continuous","title":"Categorical Normalizing Flows via Continuous Transformations","date":"2020-06-17","arxiv_id":"2006.09790","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/categorical-normalizing-flows-via-continuous#ran","syntology_url":"https://syntology.ai/paper/2006.09790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09790"}},"official":{"repos":["phlippe/CategoricalNF"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/maximum-roaming-multi-task-learning","slug":"maximum-roaming-multi-task-learning","title":"Maximum Roaming Multi-Task Learning","date":"2020-06-17","arxiv_id":"2006.09762","repositories_listed":1,"syntology":null},{"url":"/paper/counterexample-guided-learning-of-monotonic","slug":"counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","arxiv_id":"2006.08852","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/counterexample-guided-learning-of-monotonic#ran","syntology_url":"https://syntology.ai/paper/2006.08852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08852"}},"official":{"repos":["AishwaryaSivaraman/COMET"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/explanation-based-weakly-supervised-learning","slug":"explanation-based-weakly-supervised-learning","title":"Explanation-based Weakly-supervised Learning of Visual Relations with Graph Networks","date":"2020-06-16","arxiv_id":"2006.09562","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-geometry-of-wave-based-imaging","slug":"learning-the-geometry-of-wave-based-imaging","title":"Learning the geometry of wave-based imaging","date":"2020-06-10","arxiv_id":"2006.05854","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/learning-the-geometry-of-wave-based-imaging#ran","syntology_url":"https://syntology.ai/paper/2006.05854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05854"}},"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/phonetic-and-visual-priors-for-decipherment","slug":"phonetic-and-visual-priors-for-decipherment","title":"Phonetic and Visual Priors for Decipherment of Informal Romanization","date":"2020-05-05","arxiv_id":"2005.02517","repositories_listed":1,"syntology":null},{"url":"/paper/stolen-probability-a-structural-weakness-of","slug":"stolen-probability-a-structural-weakness-of","title":"Stolen Probability: A Structural Weakness of Neural Language Models","date":"2020-05-05","arxiv_id":"2005.02433","repositories_listed":1,"syntology":null},{"url":"/paper/global-relational-models-of-source-code","slug":"global-relational-models-of-source-code","title":"Global Relational Models of Source Code","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/logic-and-the-2-simplicial-transformer-1","slug":"logic-and-the-2-simplicial-transformer-1","title":"Logic and the 2-Simplicial Transformer","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-unsupervised-relation-extraction","slug":"revisiting-unsupervised-relation-extraction","title":"Revisiting Unsupervised Relation Extraction","date":"2020-04-30","arxiv_id":"2005.00087","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-unsupervised-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2005.00087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00087"}},"official":{"repos":["ttthy/ure"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/vign-variational-integrator-graph-networks","slug":"vign-variational-integrator-graph-networks","title":"Variational Integrator Graph Networks for Learning Energy Conserving Dynamical Systems","date":"2020-04-28","arxiv_id":"2004.13688","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vign-variational-integrator-graph-networks#ran","syntology_url":"https://syntology.ai/paper/2004.13688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13688"}},"official":null}},{"url":"/paper/orthogonal-over-parameterized-training","slug":"orthogonal-over-parameterized-training","title":"Orthogonal Over-Parameterized Training","date":"2020-04-09","arxiv_id":"2004.04690","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}},"official":null}},{"url":"/paper/pushnet-efficient-and-adaptive-neural-message","slug":"pushnet-efficient-and-adaptive-neural-message","title":"PushNet: Efficient and Adaptive Neural Message Passing","date":"2020-03-04","arxiv_id":"2003.02228","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/pushnet-efficient-and-adaptive-neural-message#ran","syntology_url":"https://syntology.ai/paper/2003.02228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02228"}},"official":{"repos":["buschju/pushnet"],"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/neurips-2019-disentanglement-challenge-1","slug":"neurips-2019-disentanglement-challenge-1","title":"NeurIPS 2019 Disentanglement Challenge: Improved Disentanglement through Learned Aggregation of Convolutional Feature Maps","date":"2020-02-27","arxiv_id":"2002.12356","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":2,"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/neurips-2019-disentanglement-challenge-1#ran","syntology_url":"https://syntology.ai/paper/2002.12356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12356"}},"official":{"repos":["mseitzer/neurips2019-disentanglement-challenge"],"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/local-nonparametric-meta-learning","slug":"local-nonparametric-meta-learning","title":"Local Nonparametric Meta-Learning","date":"2020-02-09","arxiv_id":"2002.03272","repositories_listed":1,"syntology":null},{"url":"/paper/multi-source-deep-gaussian-process-kernel","slug":"multi-source-deep-gaussian-process-kernel","title":"Conditional Deep Gaussian Processes: multi-fidelity kernel learning","date":"2020-02-07","arxiv_id":"2002.02826","repositories_listed":1,"syntology":null},{"url":"/paper/from-learning-to-meta-learning-reduced","slug":"from-learning-to-meta-learning-reduced","title":"From Learning to Meta-Learning: Reduced Training Overhead and Complexity for Communication Systems","date":"2020-01-05","arxiv_id":"2001.01227","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-brains-how-to-regularize-1","slug":"learning-from-brains-how-to-regularize-1","title":"Learning From Brains How to Regularize Machines","date":"2019-11-11","arxiv_id":"1911.05072","repositories_listed":1,"syntology":null},{"url":"/paper/hmeae-hierarchical-modular-event-argument","slug":"hmeae-hierarchical-modular-event-argument","title":"HMEAE: Hierarchical Modular Event Argument Extraction","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-convex-optimization-layers","slug":"differentiable-convex-optimization-layers","title":"Differentiable Convex Optimization Layers","date":"2019-10-28","arxiv_id":"1910.12430","repositories_listed":1,"syntology":null},{"url":"/paper/poisson-randomized-gamma-dynamical-systems","slug":"poisson-randomized-gamma-dynamical-systems","title":"Poisson-Randomized Gamma Dynamical Systems","date":"2019-10-28","arxiv_id":"1910.12991","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-knowledge-tracing-modeling","slug":"graph-based-knowledge-tracing-modeling","title":"Graph-based Knowledge Tracing: Modeling Student Proficiency Using Graph Neural Network","date":"2019-10-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/beyond-vector-spaces-compact-data","slug":"beyond-vector-spaces-compact-data","title":"Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs","date":"2019-10-08","arxiv_id":"1910.03524","repositories_listed":1,"syntology":null},{"url":"/paper/receding-horizon-curiosity","slug":"receding-horizon-curiosity","title":"Receding Horizon Curiosity","date":"2019-10-08","arxiv_id":"1910.03620","repositories_listed":1,"syntology":null},{"url":"/paper/making-sense-of-sensory-input","slug":"making-sense-of-sensory-input","title":"Making sense of sensory input","date":"2019-10-05","arxiv_id":"1910.02227","repositories_listed":1,"syntology":null},{"url":"/paper/over-parameterization-as-a-catalyst-for","slug":"over-parameterization-as-a-catalyst-for","title":"Student Specialization in Deep ReLU Networks With Finite Width and Input Dimension","date":"2019-09-30","arxiv_id":"1909.13458","repositories_listed":1,"syntology":null},{"url":"/paper/symplectic-ode-net-learning-hamiltonian","slug":"symplectic-ode-net-learning-hamiltonian","title":"Symplectic ODE-Net: Learning Hamiltonian Dynamics with Control","date":"2019-09-26","arxiv_id":"1909.12077","repositories_listed":1,"syntology":null},{"url":"/paper/learning-interpretable-disease-self","slug":"learning-interpretable-disease-self","title":"Learning Interpretable Disease Self-Representations for Drug Repositioning","date":"2019-09-14","arxiv_id":"1909.06609","repositories_listed":1,"syntology":null},{"url":"/paper/learning-semantic-parsers-from-denotations","slug":"learning-semantic-parsers-from-denotations","title":"Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programs","date":"2019-09-09","arxiv_id":"1909.04165","repositories_listed":1,"syntology":null},{"url":"/paper/learning-visual-dynamics-models-of-rigid","slug":"learning-visual-dynamics-models-of-rigid","title":"Learning Visual Dynamics Models of Rigid Objects using Relational Inductive Biases","date":"2019-09-09","arxiv_id":"1909.03749","repositories_listed":1,"syntology":null},{"url":"/paper/additive-function-approximation-in-the-brain","slug":"additive-function-approximation-in-the-brain","title":"Additive function approximation in the brain","date":"2019-09-05","arxiv_id":"1909.02603","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-pointer-net-parsing","slug":"hierarchical-pointer-net-parsing","title":"Hierarchical Pointer Net Parsing","date":"2019-08-30","arxiv_id":"1908.11571","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-with-warped-gradient-descent","slug":"meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","arxiv_id":"1909.00025","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/meta-learning-with-warped-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1909.00025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00025"}},"official":{"repos":["flennerhag/warpgrad"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/contextualized-diachronic-word","slug":"contextualized-diachronic-word","title":"Contextualized Diachronic Word Representations","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/symbolic-inductive-bias-for-visually-grounded-1","slug":"symbolic-inductive-bias-for-visually-grounded-1","title":"Symbolic Inductive Bias for Visually Grounded Learning of Spoken Language","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explicit-disentanglement-of-appearance-and","slug":"explicit-disentanglement-of-appearance-and","title":"Explicit Disentanglement of Appearance and Perspective in Generative Models","date":"2019-06-11","arxiv_id":"1906.11881","repositories_listed":1,"syntology":null},{"url":"/paper/190600271","slug":"190600271","title":"GLAD: Learning Sparse Graph Recovery","date":"2019-06-01","arxiv_id":"1906.00271","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190600271#ran","syntology_url":"https://syntology.ai/paper/1906.00271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00271"}},"official":{"repos":["Harshs27/GLAD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-inductive-bias-of-neural-tangent","slug":"on-the-inductive-bias-of-neural-tangent","title":"On the Inductive Bias of Neural Tangent Kernels","date":"2019-05-29","arxiv_id":"1905.12173","repositories_listed":1,"syntology":null},{"url":"/paper/better-long-range-dependency-by-bootstrapping","slug":"better-long-range-dependency-by-bootstrapping","title":"Better Long-Range Dependency By Bootstrapping A Mutual Information Regularizer","date":"2019-05-28","arxiv_id":"1905.11978","repositories_listed":1,"syntology":null},{"url":"/paper/physics-as-inverse-graphics-joint","slug":"physics-as-inverse-graphics-joint","title":"Physics-as-Inverse-Graphics: Unsupervised Physical Parameter Estimation from Video","date":"2019-05-27","arxiv_id":"1905.11169","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/physics-as-inverse-graphics-joint#ran","syntology_url":"https://syntology.ai/paper/1905.11169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11169"}},"official":null}},{"url":"/paper/bivariate-beta-lstm","slug":"bivariate-beta-lstm","title":"Bivariate Beta-LSTM","date":"2019-05-25","arxiv_id":"1905.10521","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bivariate-beta-lstm#ran","syntology_url":"https://syntology.ai/paper/1905.10521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10521"}},"official":{"repos":["gtshs2/BetaLSTM"],"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/good-enough-compositional-data-augmentation","slug":"good-enough-compositional-data-augmentation","title":"Good-Enough Compositional Data Augmentation","date":"2019-04-21","arxiv_id":"1904.09545","repositories_listed":1,"syntology":null},{"url":"/paper/imposing-label-relational-inductive-bias-for","slug":"imposing-label-relational-inductive-bias-for","title":"Imposing Label-Relational Inductive Bias for Extremely Fine-Grained Entity Typing","date":"2019-03-06","arxiv_id":"1903.02591","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-of-model-free-planning","slug":"an-investigation-of-model-free-planning","title":"An investigation of model-free planning","date":"2019-01-11","arxiv_id":"1901.03559","repositories_listed":1,"syntology":null},{"url":"/paper/training-deep-capsule-networks","slug":"training-deep-capsule-networks","title":"Increasing the adversarial robustness and explainability of capsule networks with $γ$-capsules","date":"2018-12-23","arxiv_id":"1812.09707","repositories_listed":1,"syntology":null},{"url":"/paper/symbolic-inductive-bias-for-visually-grounded","slug":"symbolic-inductive-bias-for-visually-grounded","title":"Symbolic inductive bias for visually grounded learning of spoken language","date":"2018-12-21","arxiv_id":"1812.09244","repositories_listed":1,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/symbolic-inductive-bias-for-visually-grounded#ran","syntology_url":"https://syntology.ai/paper/1812.09244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.09244"}},"official":{"repos":["gchrupala/symbolic-bias"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/the-effect-of-heterogeneous-data-for","slug":"the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","arxiv_id":"1811.12254","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/the-effect-of-heterogeneous-data-for#ran","syntology_url":"https://syntology.ai/paper/1811.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12254"}},"official":null}}],"record_sha256":"b0c7486bee686d9978439e81e26c6943891ec5ba3f9daadc35fdb94ef0880078","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}