{"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/16","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":16,"pages_in_order":16,"rows_per_page":100,"rows":[1501,1529],"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/15","next":null,"papers":[{"url":null,"slug":"knowledge-based-distant-regularization-in","title":"Knowledge-Based Distant Regularization in Learning Probabilistic Models","date":"2018-06-29","arxiv_id":"1806.11332","repositories_listed":0,"syntology":null},{"url":null,"slug":"relational-inductive-bias-for-physical","title":"Relational inductive bias for physical construction in humans and machines","date":"2018-06-04","arxiv_id":"1806.01203","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-importance-of-attention-in-meta","title":"On the Importance of Attention in Meta-Learning for Few-Shot Text Classification","date":"2018-06-03","arxiv_id":"1806.00852","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-embedding-of-knowledge-graphs","title":"Probabilistic Embedding of Knowledge Graphs with Box Lattice Measures","date":"2018-05-17","arxiv_id":"1805.06627","repositories_listed":0,"syntology":null},{"url":null,"slug":"metabags-bagged-meta-decision-trees-for","title":"MetaBags: Bagged Meta-Decision Trees for Regression","date":"2018-04-17","arxiv_id":"1804.06207","repositories_listed":0,"syntology":null},{"url":null,"slug":"pooling-is-neither-necessary-nor-sufficient","title":"Pooling is neither necessary nor sufficient for appropriate deformation stability in CNNs","date":"2018-04-12","arxiv_id":"1804.04438","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-neural-networks-understand-logical","title":"Can Neural Networks Understand Logical Entailment?","date":"2018-02-23","arxiv_id":"1802.08535","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-characterizing-the-capacity-of-neural","title":"On Characterizing the Capacity of Neural Networks using Algebraic Topology","date":"2018-02-13","arxiv_id":"1802.04443","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-value-approximators-learning-when-to","title":"Natural Value Approximators: Learning when to Trust Past Estimates","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"conll-sigmorphon-2017-shared-task-universal","title":"CoNLL-SIGMORPHON 2017 Shared Task: Universal Morphological Reinflection in 52 Languages","date":"2017-06-27","arxiv_id":"1706.09031","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-pairwise-clustering-with-side-information","title":"On Pairwise Clustering with Side Information","date":"2017-06-19","arxiv_id":"1706.06474","repositories_listed":0,"syntology":null},{"url":null,"slug":"question-answering-with-grammatically","title":"Question-Answering with Grammatically-Interpretable Representations","date":"2017-05-23","arxiv_id":"1705.08432","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-and-design-of-convolutional-networks","title":"Analysis and Design of Convolutional Networks via Hierarchical Tensor Decompositions","date":"2017-05-05","arxiv_id":"1705.02302","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-and-quantum-entanglement","title":"Deep Learning and Quantum Entanglement: Fundamental Connections with Implications to Network Design","date":"2017-04-05","arxiv_id":"1704.01552","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimally-naturalistic-artificial","title":"Minimally Naturalistic Artificial Intelligence","date":"2017-01-14","arxiv_id":"1701.03868","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-inductive-biases-for-factorial","title":"A Survey of Inductive Biases for Factorial Representation-Learning","date":"2016-12-15","arxiv_id":"1612.05299","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-step-learning-and-underlying-structure","title":"Multi-step learning and underlying structure in statistical models","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lifelong-learning-with-non-iid-tasks","title":"Lifelong Learning with Non-i.i.d. Tasks","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"blending-lstms-into-cnns","title":"Blending LSTMs into CNNs","date":"2015-11-19","arxiv_id":"1511.06433","repositories_listed":0,"syntology":null},{"url":null,"slug":"bias-and-population-structure-in-the","title":"Bias and population structure in the actuation of sound change","date":"2015-07-16","arxiv_id":"1507.04420","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-general-intelligence-through","title":"Artificial general intelligence through recursive data compression and grounded reasoning: a position paper","date":"2015-06-14","arxiv_id":"1506.04366","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-representations-of-words-to-guide","title":"Distributed Representations of Words to Guide Bootstrapped Entity Classifiers","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"in-search-of-the-real-inductive-bias-on-the","title":"In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learning","date":"2014-12-20","arxiv_id":"1412.6614","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-inductive-bias-of-dropout","title":"On the Inductive Bias of Dropout","date":"2014-12-15","arxiv_id":"1412.4736","repositories_listed":0,"syntology":null},{"url":null,"slug":"controlling-complexity-in-part-of-speech","title":"Controlling Complexity in Part-of-Speech Induction","date":"2014-01-16","arxiv_id":"1401.6131","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-imprecise-and-fuzzy","title":"Learning from Imprecise and Fuzzy Observations: Data Disambiguation through Generalized Loss Minimization","date":"2013-05-03","arxiv_id":"1305.0698","repositories_listed":0,"syntology":null},{"url":null,"slug":"q-mkl-matrix-induced-regularization-in-multi","title":"Q-MKL: Matrix-induced Regularization in Multi-Kernel Learning with Applications to Neuroimaging","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-of-inductive-bias-learning","title":"A Model of Inductive Bias Learning","date":"2011-06-01","arxiv_id":"1106.0245","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-theories-of-everything","title":"Algorithmic Theories of Everything","date":"2000-11-30","arxiv_id":"quant-ph/0011122","repositories_listed":0,"syntology":null}],"record_sha256":"c3a170b19db60d479c6e5ee384d5e020102fe494b2bbc61ab49a563eae7e43fb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}