{"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/15","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":15,"pages_in_order":16,"rows_per_page":100,"rows":[1401,1500],"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/14","next":"/task/inductive-bias/papers/16","papers":[{"url":null,"slug":"gradient-descent-converges-to-ridgelet","title":"Ridge Regression with Over-Parametrized Two-Layer Networks Converge to Ridgelet Spectrum","date":"2020-07-07","arxiv_id":"2007.03441","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-collaborative-conversations-using","title":"Identifying Collaborative Conversations using Latent Discourse Behaviors","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-image-captioning-with-better-use-of","title":"Improving Image Captioning with Better Use of Caption","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-sgd-a-bayesian-sampler-well-almost","title":"Is SGD a Bayesian sampler? Well, almost","date":"2020-06-26","arxiv_id":"2006.15191","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-domain-adaptation-representations","title":"Robust Domain Adaptation: Representations, Weights and Inductive Bias","date":"2020-06-24","arxiv_id":"2006.13629","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalisable-relational-reasoning-with","title":"Extrapolatable Relational Reasoning With Comparators in Low-Dimensional Manifolds","date":"2020-06-15","arxiv_id":"2006.08698","repositories_listed":0,"syntology":null},{"url":null,"slug":"dnf-net-a-neural-architecture-for-tabular","title":"DNF-Net: A Neural Architecture for Tabular Data","date":"2020-06-11","arxiv_id":"2006.06465","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-2","title":"Information-Theoretic Generalization Bounds for Meta-Learning and Applications","date":"2020-05-09","arxiv_id":"2005.04372","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-of-two-layer-neural-networks","title":"Generalization of Two-layer Neural Networks: An Asymptotic Viewpoint","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implementing-inductive-bias-for-different","title":"Implementing Inductive bias for different navigation tasks through diverse RNN attrractors","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-transformer-language-models","title":"Multi-scale Transformer Language Models","date":"2020-05-01","arxiv_id":"2005.00581","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiplicative-interactions-and-where-to-find","title":"Multiplicative Interactions and Where to Find Them","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-deep-network-architecture-for","title":"Towards a Deep Network Architecture for Structured Smoothness","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-design-in-synthetically-accessible","title":"Molecular Design in Synthetically Accessible Chemical Space via Deep Reinforcement Learning","date":"2020-04-29","arxiv_id":"2004.14308","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-causal-generative-scene-models-via","title":"Towards causal generative scene models via competition of experts","date":"2020-04-27","arxiv_id":"2004.12906","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-grammar-of-prescription","title":"Learning the grammar of drug prescription: recurrent neural network grammars for medication information extraction in clinical texts","date":"2020-04-24","arxiv_id":"2004.11622","repositories_listed":0,"syntology":null},{"url":null,"slug":"syntax-driven-iterative-expansion-language","title":"Syntax-driven Iterative Expansion Language Models for Controllable Text Generation","date":"2020-04-05","arxiv_id":"2004.02211","repositories_listed":0,"syntology":null},{"url":null,"slug":"weight-priors-for-learning-identity-relations","title":"Weight Priors for Learning Identity Relations","date":"2020-03-06","arxiv_id":"2003.03125","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-hard-physical-constraints-in","title":"Embedding Hard Physical Constraints in Convolutional Neural Networks for 3D Turbulence","date":"2020-02-26","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-gaussian-processes-for","title":"Graph Convolutional Gaussian Processes For Link Prediction","date":"2020-02-11","arxiv_id":"2002.04337","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-spatial-invariance-with-low-rank","title":"Revisiting Spatial Invariance with Low-Rank Local Connectivity","date":"2020-02-07","arxiv_id":"2002.02959","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-bidirectional-decoding-for-local","title":"Pseudo-Bidirectional Decoding for Local Sequence Transduction","date":"2020-01-31","arxiv_id":"2001.11694","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-learning-vehicle-detection-in-satellite","title":"On Learning Vehicle Detection in Satellite Video","date":"2020-01-29","arxiv_id":"2001.10900","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-syntax-need-to-grow-on-trees-sources-of","title":"Does syntax need to grow on trees? Sources of hierarchical inductive bias in sequence-to-sequence networks","date":"2020-01-10","arxiv_id":"2001.03632","repositories_listed":0,"syntology":null},{"url":null,"slug":"multitask-learning-over-graphs","title":"Multitask learning over graphs: An Approach for Distributed, Streaming Machine Learning","date":"2020-01-07","arxiv_id":"2001.02112","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-bias-driven-reinforcement-learning-1","title":"Inductive Bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"metagross-meta-gated-recursive-controller","title":"Metagross: Meta Gated Recursive Controller Units for Sequence Modeling","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"netgan-without-gan-from-random-walks-to-low","title":"NetGAN without GAN: From Random Walks to Low-Rank Approximations","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"student-specialization-in-deep-rectified","title":"Student Specialization in Deep Rectified Networks With Finite Width and Input Dimension","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"just-add-functions-a-neural-symbolic-language","title":"Just Add Functions: A Neural-Symbolic Language Model","date":"2019-12-11","arxiv_id":"1912.05421","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-supervision-helps-emergence-of-word","title":"Weak Supervision helps Emergence of Word-Object Alignment and improves Vision-Language Tasks","date":"2019-12-06","arxiv_id":"1912.03063","repositories_listed":0,"syntology":null},{"url":null,"slug":"sag-vae-end-to-end-joint-inference-of-data","title":"SAG-VAE: End-to-end Joint Inference of Data Representations and Feature Relations","date":"2019-11-27","arxiv_id":"1911.11984","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-disentanglement-with-independence","title":"Towards Better Understanding of Disentangled Representations via Mutual Information","date":"2019-11-25","arxiv_id":"1911.10922","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-disentanglement-through-learned","title":"Improved Disentanglement through Learned Aggregation of Convolutional Feature Maps","date":"2019-11-15","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-combinatorial-generalization-in","title":"Rate-Regularization and Generalization in VAEs","date":"2019-11-11","arxiv_id":"1911.04594","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-fidelity-video-prediction-with-large","title":"High Fidelity Video Prediction with Large Stochastic Recurrent Neural Networks","date":"2019-11-05","arxiv_id":"1911.01655","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-lottery-tickets-under","title":"Evaluating Lottery Tickets Under Distributional Shifts","date":"2019-10-28","arxiv_id":"1910.12708","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-representation-learning-for-audio-music","title":"Graph Representation learning for Audio & Music genre Classification","date":"2019-10-23","arxiv_id":"1910.11117","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-ordinal-vae-employing-noisy-pairwise","title":"Robust Ordinal VAE: Employing Noisy Pairwise Comparisons for Disentanglement","date":"2019-10-14","arxiv_id":"1910.05898","repositories_listed":0,"syntology":null},{"url":null,"slug":"r-sqair-relational-sequential-attend-infer","title":"R-SQAIR: Relational Sequential Attend, Infer, Repeat","date":"2019-10-11","arxiv_id":"1910.05231","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-image-recognition-with-non","title":"Boosting Image Recognition with Non-differentiable Constraints","date":"2019-10-02","arxiv_id":"1910.00736","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-abstractive-summaries-with","title":"Generating Abstractive Summaries with Finetuned Language Models","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ant-swarm-neuro-evolution-procedure-for","title":"The Ant Swarm Neuro-Evolution Procedure for Optimizing Recurrent Networks","date":"2019-09-26","arxiv_id":"1909.11849","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-over-phrases","title":"Attention over Phrases","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"global-local-network-for-learning-depth-with","title":"Global-Local Network for Learning Depth with Very Sparse Supervision","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-entailment-based-sentence-embeddings","title":"Learning Entailment-Based Sentence Embeddings from Natural Language Inference","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-entanglement-entropy-for-deep","title":"Leveraging Entanglement Entropy for Deep Understanding of Attention Matrix in Text Matching","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-inductive-bias-of-neural-networks-1","title":"Leveraging inductive bias of neural networks for learning without explicit human annotations","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-are-textita-priori-biased","title":"Neural networks are a priori biased towards Boolean functions with low entropy","date":"2019-09-25","arxiv_id":"1909.11522","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-implicit-minimization-of-alternative","title":"On the implicit minimization of alternative loss functions when training deep networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"procedural-reasoning-networks-for","title":"Procedural Reasoning Networks for Understanding Multimodal Procedures","date":"2019-09-19","arxiv_id":"1909.08859","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-symbolic-physics-with-graph-networks","title":"Learning Symbolic Physics with Graph Networks","date":"2019-09-12","arxiv_id":"1909.05862","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-compact-neural-networks-via","title":"Auxiliary Learning for Deep Multi-task Learning","date":"2019-09-05","arxiv_id":"1909.02214","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-bias-driven-reinforcement-learning","title":"Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","date":"2019-09-04","arxiv_id":"1909.02119","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-better-modeling-hierarchical","title":"Towards Better Modeling Hierarchical Structure for Self-Attention with Ordered Neurons","date":"2019-09-04","arxiv_id":"1909.01562","repositories_listed":0,"syntology":null},{"url":null,"slug":"logic-and-the-2-simplicial-transformer","title":"Logic and the $2$-Simplicial Transformer","date":"2019-09-02","arxiv_id":"1909.00668","repositories_listed":0,"syntology":null},{"url":null,"slug":"naive-regularizers-for-low-resource-neural","title":"Naive Regularizers for Low-Resource Neural Machine Translation","date":"2019-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"repurposing-decoder-transformer-language","title":"Repurposing Decoder-Transformer Language Models for Abstractive Summarization","date":"2019-09-01","arxiv_id":"1909.00325","repositories_listed":0,"syntology":null},{"url":null,"slug":"promoting-coordination-through-policy","title":"Promoting Coordination through Policy Regularization in Multi-Agent Deep Reinforcement Learning","date":"2019-08-06","arxiv_id":"1908.02269","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-relational-representations-for","title":"Disentangled Relational Representations for Explaining and Learning from Demonstration","date":"2019-07-31","arxiv_id":"1907.13627","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-deep-learning","title":"Compositional Deep Learning","date":"2019-07-16","arxiv_id":"1907.08292","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-distance-dependencies-dont-have-to-be","title":"Long-Distance Dependencies Don't Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations","date":"2019-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factors-for-the-generalisation-of-identity","title":"Factors for the Generalisation of Identity Relations by Neural Networks","date":"2019-06-13","arxiv_id":"1906.05449","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-bias-of-gradient-descent-based","title":"Inductive Bias of Gradient Descent based Adversarial Training on Separable Data","date":"2019-06-07","arxiv_id":"1906.02931","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-clustered-representation-for-complex","title":"Learning Clustered Representation for Complex Free Energy Landscapes","date":"2019-06-07","arxiv_id":"1906.02852","repositories_listed":0,"syntology":null},{"url":null,"slug":"quaternion-collaborative-filtering-for","title":"Quaternion Collaborative Filtering for Recommendation","date":"2019-06-06","arxiv_id":"1906.02594","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-physics-based-domain-knowledge-and","title":"Physics Enhanced Data-Driven Models with Variational Gaussian Processes","date":"2019-06-05","arxiv_id":"1906.02160","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dynamic-polynomial-proofs","title":"Learning dynamic polynomial proofs","date":"2019-06-04","arxiv_id":"1906.01681","repositories_listed":0,"syntology":null},{"url":null,"slug":"where-is-the-information-in-a-deep-neural","title":"Where is the Information in a Deep Neural Network?","date":"2019-05-29","arxiv_id":"1905.12213","repositories_listed":0,"syntology":null},{"url":null,"slug":"190513540","title":"Gaining Extra Supervision via Multi-task learning for Multi-Modal Video Question Answering","date":"2019-05-28","arxiv_id":"1905.13540","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-graph-convolutional-networks-for","title":"Temporal Graph Convolutional Networks for Automatic Seizure Detection","date":"2019-05-03","arxiv_id":"1905.01375","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-task-agnostic-meta-learning-for-few","title":"Attentive Task-Agnostic Meta-Learning for Few-Shot Text Classification","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"intrinsic-social-motivation-via-causal","title":"Intrinsic Social Motivation via Causal Influence in Multi-Agent RL","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modulating-transfer-between-tasks-in-gradient","title":"Modulating transfer between tasks in gradient-based meta-learning","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-learning-with-gradient","title":"Multi-task Learning with Gradient Communication","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-the-geometry-of-probabilistic-box","title":"Smoothing the Geometry of Probabilistic Box Embeddings","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"autosem-automatic-task-selection-and-mixing","title":"AutoSeM: Automatic Task Selection and Mixing in Multi-Task Learning","date":"2019-04-08","arxiv_id":"1904.04153","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastically-rank-regularized-tensor","title":"Tensor Dropout for Robust Learning","date":"2019-02-27","arxiv_id":"1902.10758","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-modeling-with-matrix-product","title":"Probabilistic Modeling with Matrix Product States","date":"2019-02-19","arxiv_id":"1902.06888","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bandit-framework-for-optimal-selection-of","title":"A Bandit Framework for Optimal Selection of Reinforcement Learning Agents","date":"2019-02-10","arxiv_id":"1902.03657","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-predict-fluid-dynamics","title":"Fast Neural Network Predictions from Constrained Aerodynamics Datasets","date":"2019-01-26","arxiv_id":"1902.00091","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-wise-bias-amplification","title":"Feature-Wise Bias Amplification","date":"2018-12-21","arxiv_id":"1812.08999","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-gradient-based-mixtures-for-transfer","title":"Reconciling meta-learning and continual learning with online mixtures of tasks","date":"2018-12-14","arxiv_id":"1812.06080","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-multi-task-learning-approach-to-skin","title":"A Deep Multi-task Learning Approach to Skin Lesion Classification","date":"2018-12-09","arxiv_id":"1812.03527","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-identity-rules-with-neural-networks","title":"Modelling Identity Rules with Neural Networks","date":"2018-12-06","arxiv_id":"1812.02616","repositories_listed":0,"syntology":null},{"url":null,"slug":"feed-forward-neural-networks-need-inductive","title":"Feed-Forward Neural Networks Need Inductive Bias to Learn Equality Relations","date":"2018-12-04","arxiv_id":"1812.01662","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-inductive-bias-of-word-character-level","title":"On the Inductive Bias of Word-Character-Level Multi-Task Learning for Speech Recognition","date":"2018-11-28","arxiv_id":"1812.02308","repositories_listed":0,"syntology":null},{"url":"/paper/unsupervised-meta-learning-for-few-shot-image","slug":"unsupervised-meta-learning-for-few-shot-image","title":"Unsupervised Meta-Learning For Few-Shot Image Classification","date":"2018-11-28","arxiv_id":"1811.11819","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-inductive-bias-of-words-in-acoustics","title":"On The Inductive Bias of Words in Acoustics-to-Word Models","date":"2018-10-31","arxiv_id":"1810.13407","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-multi-task-communication","title":"Meta-Learning Multi-task Communication","date":"2018-10-23","arxiv_id":"1810.09988","repositories_listed":0,"syntology":null},{"url":null,"slug":"visualizing-music-transformer","title":"Visualizing Music Transformer","date":"2018-10-23","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-inductive-bias-of-word-character-level-1","title":"On the Inductive Bias of Word-Character-Level Multi-Task Learning for Speech Recognition","date":"2018-10-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-case-for-object-compositionality-in-deep","title":"Investigating Object Compositionality in Generative Adversarial Networks","date":"2018-10-17","arxiv_id":"1810.10340","repositories_listed":0,"syntology":null},{"url":null,"slug":"memorization-in-overparameterized","title":"Memorization in Overparameterized Autoencoders","date":"2018-10-16","arxiv_id":"1810.10333","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-particle-dynamics-for-manipulating","title":"Learning Particle Dynamics for Manipulating Rigid Bodies, Deformable Objects, and Fluids","date":"2018-10-03","arxiv_id":"1810.01566","repositories_listed":0,"syntology":null},{"url":null,"slug":"assumption-questioning-latent-copying-and","title":"Assumption Questioning: Latent Copying and Reward Exploitation in Question Generation","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-inductive-bias-of-restricted-f-gans","title":"The Inductive Bias of Restricted f-GANs","date":"2018-09-12","arxiv_id":"1809.04542","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-of-the-mathematical-foundations-of","title":"Importance of the Mathematical Foundations of Machine Learning Methods for Scientific and Engineering Applications","date":"2018-08-07","arxiv_id":"1808.02213","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularizing-autoencoder-based-matrix","title":"Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning","date":"2018-07-04","arxiv_id":"1807.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-knowledge-sharing-in-multi-task","title":"Adaptive Knowledge Sharing in Multi-Task Learning: Improving Low-Resource Neural Machine Translation","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"b1b2f13c36bd43f53c521d295a002ade015af47373e73ff6c0fc2a221e1dfecb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}