{"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":"/dataset/mnist/papers/2","list_of":"/dataset/mnist","dataset":"MNIST","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_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'","samples_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)"},"order":"archive","order_definition":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":216,"counts":{"papers_with_a_benchmark_row":216,"with_a_code_link":180,"where_syntology_ran_a_sample":78,"not_listed_spam_title":0,"listed":216,"listed_where_code_ran":78,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":66,"every_run_a_failure_of_syntologys_instrument":12,"listed_with_a_run_with_no_instrument_failure":66,"listed_every_run_a_failure_of_syntologys_instrument":12,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/mnist","prev":"/dataset/mnist","next":"/dataset/mnist/papers/3","papers":[{"paper":"/paper/how-to-train-your-neural-ode","slug":"how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","arxiv_id":"2002.02798","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-train-your-neural-ode#ran","syntology_url":"https://syntology.ai/paper/2002.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02798"}}}},{"paper":"/paper/a-branching-and-merging-convolutional-network","slug":"a-branching-and-merging-convolutional-network","title":"No Routing Needed Between Capsules","date":"2020-01-24","arxiv_id":"2001.09136","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/stochastic-optimization-of-plain","slug":"stochastic-optimization-of-plain","title":"Stochastic Optimization of Plain Convolutional Neural Networks with Simple methods","date":"2020-01-24","arxiv_id":"2001.08856","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recurrent-highway-networks-with-grouped","slug":"recurrent-highway-networks-with-grouped","title":"Recurrent Highway Networks with Grouped Auxiliary Memory","date":"2019-12-13","arxiv_id":null,"rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/general-e2-equivariant-steerable-cnns","slug":"general-e2-equivariant-steerable-cnns","title":"General E(2)-Equivariant Steerable CNNs","date":"2019-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/legendre-memory-units-continuous-time","slug":"legendre-memory-units-continuous-time","title":"Legendre Memory Units: Continuous-Time Representation in Recurrent Neural Networks","date":"2019-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/light-weight-calibrator-a-separable-component","slug":"light-weight-calibrator-a-separable-component","title":"Light-weight Calibrator: a Separable Component for Unsupervised Domain Adaptation","date":"2019-11-28","arxiv_id":"1911.12796","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/the-weighted-tsetlin-machine-compressed","slug":"the-weighted-tsetlin-machine-compressed","title":"The Weighted Tsetlin Machine: Compressed Representations with Weighted Clauses","date":"2019-11-28","arxiv_id":"1911.12607","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/gating-revisited-deep-multi-layer-rnns-that-1","slug":"gating-revisited-deep-multi-layer-rnns-that-1","title":"Gating Revisited: Deep Multi-layer RNNs That Can Be Trained","date":"2019-11-25","arxiv_id":"1911.11033","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/structural-analysis-of-sparse-neural-networks","slug":"structural-analysis-of-sparse-neural-networks","title":"Structural Analysis of Sparse Neural Networks","date":"2019-10-16","arxiv_id":"1910.07225","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-independently-recurrent-neural-network","slug":"deep-independently-recurrent-neural-network","title":"Deep Independently Recurrent Neural Network (IndRNN)","date":"2019-10-11","arxiv_id":"1910.06251","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/prescribed-generative-adversarial-networks","slug":"prescribed-generative-adversarial-networks","title":"Prescribed Generative Adversarial Networks","date":"2019-10-09","arxiv_id":"1910.04302","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/adversarial-deep-embedded-clustering-on-a","slug":"adversarial-deep-embedded-clustering-on-a","title":"Adversarial Deep Embedded Clustering: on a better trade-off between Feature Randomness and Feature Drift","date":"2019-09-26","arxiv_id":"1909.11832","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cycle-consistent-conditional-adversarial","slug":"cycle-consistent-conditional-adversarial","title":"Cycle-consistent Conditional Adversarial Transfer Networks","date":"2019-09-17","arxiv_id":"1909.07618","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/n2dnot-too-deep-clustering-via-clustering-the","slug":"n2dnot-too-deep-clustering-via-clustering-the","title":"N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding","date":"2019-08-16","arxiv_id":"1908.05968","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["rymc/n2d"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n2dnot-too-deep-clustering-via-clustering-the#ran","syntology_url":"https://syntology.ai/paper/1908.05968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05968"}}}},{"paper":"/paper/pcgan-char-progressively-trained-classifier","slug":"pcgan-char-progressively-trained-classifier","title":"PCGAN-CHAR: Progressively Trained Classifier Generative Adversarial Networks for Classification of Noisy Handwritten Bangla Characters","date":"2019-08-11","arxiv_id":"1908.08987","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/neupde-neural-network-based-ordinary-and","slug":"neupde-neural-network-based-ordinary-and","title":"NeuPDE: Neural Network Based Ordinary and Partial Differential Equations for Modeling Time-Dependent Data","date":"2019-08-08","arxiv_id":"1908.03190","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mintnet-building-invertible-neural-networks","slug":"mintnet-building-invertible-neural-networks","title":"MintNet: Building Invertible Neural Networks with Masked Convolutions","date":"2019-07-18","arxiv_id":"1907.07945","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["DSE-MSU/R-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}}}},{"paper":"/paper/sparse-networks-from-scratch-faster-training","slug":"sparse-networks-from-scratch-faster-training","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","date":"2019-07-10","arxiv_id":"1907.04840","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["TimDettmers/sparse_learning"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sparse-networks-from-scratch-faster-training#ran","syntology_url":"https://syntology.ai/paper/1907.04840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04840"}}}},{"paper":"/paper/residual-flows-for-invertible-generative","slug":"residual-flows-for-invertible-generative","title":"Residual Flows for Invertible Generative Modeling","date":"2019-06-06","arxiv_id":"1906.02735","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["rtqichen/residual-flows"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/residual-flows-for-invertible-generative#ran","syntology_url":"https://syntology.ai/paper/1906.02735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02735"}}}},{"paper":"/paper/balanced-self-paced-learning-for-generative","slug":"balanced-self-paced-learning-for-generative","title":"Balanced Self-Paced Learning for Generative Adversarial Clustering Network","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/d-sne-domain-adaptation-using-stochastic","slug":"d-sne-domain-adaptation-using-stochastic","title":"d-SNE: Domain Adaptation Using Stochastic Neighborhood Embedding","date":"2019-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improved-training-speed-accuracy-and-data","slug":"improved-training-speed-accuracy-and-data","title":"Improved Training Speed, Accuracy, and Data Utilization Through Loss Function Optimization","date":"2019-05-27","arxiv_id":"1905.11528","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/190510748","slug":"190510748","title":"Learning Smooth Representation for Unsupervised Domain Adaptation","date":"2019-05-26","arxiv_id":"1905.10748","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/generative-latent-flow-a-framework-for-non","slug":"generative-latent-flow-a-framework-for-non","title":"Generative Latent Flow","date":"2019-05-24","arxiv_id":"1905.10485","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generative-latent-flow-a-framework-for-non#ran","syntology_url":"https://syntology.ai/paper/1905.10485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10485"}}}},{"paper":"/paper/the-convolutional-tsetlin-machine","slug":"the-convolutional-tsetlin-machine","title":"The Convolutional Tsetlin Machine","date":"2019-05-23","arxiv_id":"1905.09688","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["cair/convolutional-tsetlin-machine","cair/pyTsetlinMachineParallel"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-convolutional-tsetlin-machine#ran","syntology_url":"https://syntology.ai/paper/1905.09688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09688"}}}},{"paper":"/paper/graph-convolutional-gaussian-processes","slug":"graph-convolutional-gaussian-processes","title":"Graph Convolutional Gaussian Processes","date":"2019-05-14","arxiv_id":"1905.05739","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/analysing-neural-network-topologies-a-game","slug":"analysing-neural-network-topologies-a-game","title":"Analysing Neural Network Topologies: a Game Theoretic Approach","date":"2019-04-17","arxiv_id":"1904.08166","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/textcaps-handwritten-character-recognition","slug":"textcaps-handwritten-character-recognition","title":"TextCaps : Handwritten Character Recognition with Very Small Datasets","date":"2019-04-17","arxiv_id":"1904.08095","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/augmented-neural-odes","slug":"augmented-neural-odes","title":"Augmented Neural ODEs","date":"2019-04-02","arxiv_id":"1904.01681","rows_on_this_dataset":2,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["EmilienDupont/augmented-neural-odes"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/augmented-neural-odes#ran","syntology_url":"https://syntology.ai/paper/1904.01681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01681"}}}},{"paper":"/paper/robust-subspace-recovery-layer-for","slug":"robust-subspace-recovery-layer-for","title":"Robust Subspace Recovery Layer for Unsupervised Anomaly Detection","date":"2019-03-30","arxiv_id":"1904.00152","rows_on_this_dataset":5,"code_links":2,"syntology":null},{"paper":"/paper/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["thudzj/CAT"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}}}},{"paper":"/paper/puvae-a-variational-autoencoder-to-purify","slug":"puvae-a-variational-autoencoder-to-purify","title":"PuVAE: A Variational Autoencoder to Purify Adversarial Examples","date":"2019-03-02","arxiv_id":"1903.00585","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/concrete-autoencoders-for-differentiable","slug":"concrete-autoencoders-for-differentiable","title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","date":"2019-01-27","arxiv_id":"1901.09346","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mfbalin/Concrete-Autoencoders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}}}},{"paper":"/paper/deep-clustering-with-a-dynamic-autoencoder","slug":"deep-clustering-with-a-dynamic-autoencoder","title":"Deep Clustering with a Dynamic Autoencoder: From Reconstruction towards Centroids Construction","date":"2019-01-23","arxiv_id":"1901.07752","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/training-neural-networks-with-local-error","slug":"training-neural-networks-with-local-error","title":"Training Neural Networks with Local Error Signals","date":"2019-01-20","arxiv_id":"1901.06656","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}}}},{"paper":"/paper/deep-density-based-image-clustering","slug":"deep-density-based-image-clustering","title":"Deep Density-based Image Clustering","date":"2018-12-11","arxiv_id":"1812.04287","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/invertible-residual-networks","slug":"invertible-residual-networks","title":"Invertible Residual Networks","date":"2018-11-02","arxiv_id":"1811.00995","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":7,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/invertible-residual-networks#ran","syntology_url":"https://syntology.ai/paper/1811.00995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00995"}}}},{"paper":"/paper/deep-clustering-on-the-link-between","slug":"deep-clustering-on-the-link-between","title":"Deep clustering: On the link between discriminative models and K-means","date":"2018-10-09","arxiv_id":"1810.04246","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ffjord-free-form-continuous-dynamics-for","slug":"ffjord-free-form-continuous-dynamics-for","title":"FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models","date":"2018-10-02","arxiv_id":"1810.01367","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ffjord-free-form-continuous-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/1810.01367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01367"}}}},{"paper":"/paper/invariant-information-distillation-for","slug":"invariant-information-distillation-for","title":"Invariant Information Clustering for Unsupervised Image Classification and Segmentation","date":"2018-07-17","arxiv_id":"1807.06653","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":18,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["xu-ji/IIC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/invariant-information-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1807.06653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06653"}}}},{"paper":"/paper/pixel-level-reconstruction-and-classification","slug":"pixel-level-reconstruction-and-classification","title":"Pixel-level Reconstruction and Classification for Noisy Handwritten Bangla Characters","date":"2018-06-21","arxiv_id":"1806.08037","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/defense-gan-protecting-classifiers-against","slug":"defense-gan-protecting-classifiers-against","title":"Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Models","date":"2018-05-17","arxiv_id":"1805.06605","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["kabkabm/defensegan"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/defense-gan-protecting-classifiers-against#ran","syntology_url":"https://syntology.ai/paper/1805.06605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06605"}}}},{"paper":"/paper/rmdl-random-multimodel-deep-learning-for","slug":"rmdl-random-multimodel-deep-learning-for","title":"RMDL: Random Multimodel Deep Learning for Classification","date":"2018-05-03","arxiv_id":"1805.01890","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/the-tsetlin-machine-a-game-theoretic-bandit","slug":"the-tsetlin-machine-a-game-theoretic-bandit","title":"The Tsetlin Machine - A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic","date":"2018-04-04","arxiv_id":"1804.01508","rows_on_this_dataset":1,"code_links":16,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cair/TsetlinMachine","cair/fast-tsetlin-machine-with-mnist-demo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-tsetlin-machine-a-game-theoretic-bandit#ran","syntology_url":"https://syntology.ai/paper/1804.01508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.01508"}}}},{"paper":"/paper/deepjdot-deep-joint-distribution-optimal","slug":"deepjdot-deep-joint-distribution-optimal","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","date":"2018-03-27","arxiv_id":"1803.10081","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepjdot-deep-joint-distribution-optimal#ran","syntology_url":"https://syntology.ai/paper/1803.10081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10081"}}}},{"paper":"/paper/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","rows_on_this_dataset":1,"code_links":35,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["locuslab/TCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}}}},{"paper":"/paper/learning-latent-representations-in-neural","slug":"learning-latent-representations-in-neural","title":"Learning Latent Representations in Neural Networks for Clustering through Pseudo Supervision and Graph-based Activity Regularization","date":"2018-02-08","arxiv_id":"1802.03063","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-autoencoding-gaussian-mixture-model-for","slug":"deep-autoencoding-gaussian-mixture-model-for","title":"Deep Autoencoding Gaussian Mixture Model for Unsupervised Anomaly Detection","date":"2018-01-01","arxiv_id":null,"rows_on_this_dataset":5,"code_links":2,"syntology":null},{"paper":"/paper/maximum-classifier-discrepancy-for","slug":"maximum-classifier-discrepancy-for","title":"Maximum Classifier Discrepancy for Unsupervised Domain Adaptation","date":"2017-12-07","arxiv_id":"1712.02560","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["mil-tokyo/MCD_DA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/maximum-classifier-discrepancy-for#ran","syntology_url":"https://syntology.ai/paper/1712.02560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02560"}}}},{"paper":"/paper/splinecnn-fast-geometric-deep-learning-with","slug":"splinecnn-fast-geometric-deep-learning-with","title":"SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels","date":"2017-11-24","arxiv_id":"1711.08920","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/learning-steerable-filters-for-rotation","slug":"learning-steerable-filters-for-rotation","title":"Learning Steerable Filters for Rotation Equivariant CNNs","date":"2017-11-20","arxiv_id":"1711.07289","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cycada-cycle-consistent-adversarial-domain","slug":"cycada-cycle-consistent-adversarial-domain","title":"CyCADA: Cycle-Consistent Adversarial Domain Adaptation","date":"2017-11-08","arxiv_id":"1711.03213","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jhoffman/cycada_release"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cycada-cycle-consistent-adversarial-domain#ran","syntology_url":"https://syntology.ai/paper/1711.03213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03213"}}}},{"paper":"/paper/dynamic-routing-between-capsules","slug":"dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","arxiv_id":"1710.09829","rows_on_this_dataset":1,"code_links":77,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":118,"samples_ran":75,"samples_constructed":0,"samples_ran_checked":58,"samples_ran_instrument_failed":17,"samples_unverified":43,"pointer_only_for_licence":13,"official":{"repos":["Sarasra/models"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-routing-between-capsules#ran","syntology_url":"https://syntology.ai/paper/1710.09829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.09829"}}}},{"paper":"/paper/deep-convolutional-neural-networks-as-generic","slug":"deep-convolutional-neural-networks-as-generic","title":"Deep Convolutional Neural Networks as Generic Feature Extractors","date":"2017-10-06","arxiv_id":"1710.02286","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dilated-recurrent-neural-networks","slug":"dilated-recurrent-neural-networks","title":"Dilated Recurrent Neural Networks","date":"2017-10-05","arxiv_id":"1710.02224","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["code-terminator/DilatedRNN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dilated-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1710.02224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.02224"}}}},{"paper":"/paper/projectionnet-learning-efficient-on-device","slug":"projectionnet-learning-efficient-on-device","title":"ProjectionNet: Learning Efficient On-Device Deep Networks Using Neural Projections","date":"2017-08-02","arxiv_id":"1708.00630","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/self-ensembling-for-visual-domain-adaptation","slug":"self-ensembling-for-visual-domain-adaptation","title":"Self-ensembling for visual domain adaptation","date":"2017-06-16","arxiv_id":"1706.05208","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/pixelgan-autoencoders","slug":"pixelgan-autoencoders","title":"PixelGAN Autoencoders","date":"2017-06-02","arxiv_id":"1706.00531","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/conditional-adversarial-domain-adaptation","slug":"conditional-adversarial-domain-adaptation","title":"Conditional Adversarial Domain Adaptation","date":"2017-05-26","arxiv_id":"1705.10667","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["thuml/CDAN"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/conditional-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1705.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10667"}}}},{"paper":"/paper/training-deep-networks-without-learning-rates","slug":"training-deep-networks-without-learning-rates","title":"Training Deep Networks without Learning Rates Through Coin Betting","date":"2017-05-22","arxiv_id":"1705.07795","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/masked-autoregressive-flow-for-density","slug":"masked-autoregressive-flow-for-density","title":"Masked Autoregressive Flow for Density Estimation","date":"2017-05-19","arxiv_id":"1705.07057","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":28,"samples_ran":22,"samples_constructed":14,"samples_ran_checked":22,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":9,"official":{"repos":["gpapamak/maf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/masked-autoregressive-flow-for-density#ran","syntology_url":"https://syntology.ai/paper/1705.07057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07057"}}}},{"paper":"/paper/convolutional-sequence-to-sequence-learning","slug":"convolutional-sequence-to-sequence-learning","title":"Convolutional Sequence to Sequence Learning","date":"2017-05-08","arxiv_id":"1705.03122","rows_on_this_dataset":1,"code_links":37,"syntology":null},{"paper":"/paper/discriminatively-boosted-image-clustering","slug":"discriminatively-boosted-image-clustering","title":"Discriminatively Boosted Image Clustering with Fully Convolutional Auto-Encoders","date":"2017-03-23","arxiv_id":"1703.07980","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/adversarial-discriminative-domain-adaptation","slug":"adversarial-discriminative-domain-adaptation","title":"Adversarial Discriminative Domain Adaptation","date":"2017-02-17","arxiv_id":"1702.05464","rows_on_this_dataset":2,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":48,"samples_ran":14,"samples_constructed":5,"samples_ran_checked":7,"samples_ran_instrument_failed":7,"samples_unverified":34,"pointer_only_for_licence":12,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adversarial-discriminative-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1702.05464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05464"}}}},{"paper":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}}}},{"paper":"/paper/unsupervised-cross-domain-image-generation","slug":"unsupervised-cross-domain-image-generation","title":"Unsupervised Cross-Domain Image Generation","date":"2016-11-07","arxiv_id":"1611.02200","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":18,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-cross-domain-image-generation#ran","syntology_url":"https://syntology.ai/paper/1611.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.02200"}}}},{"paper":"/paper/full-capacity-unitary-recurrent-neural","slug":"full-capacity-unitary-recurrent-neural","title":"Full-Capacity Unitary Recurrent Neural Networks","date":"2016-10-31","arxiv_id":"1611.00035","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/domain-separation-networks","slug":"domain-separation-networks","title":"Domain Separation Networks","date":"2016-08-22","arxiv_id":"1608.06019","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["tensorflow/models"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-separation-networks#ran","syntology_url":"https://syntology.ai/paper/1608.06019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.06019"}}}},{"paper":"/paper/lets-keep-it-simple-using-simple","slug":"lets-keep-it-simple-using-simple","title":"Lets keep it simple, Using simple architectures to outperform deeper and more complex architectures","date":"2016-08-22","arxiv_id":"1608.06037","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["Coderx7/SimpleNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lets-keep-it-simple-using-simple#ran","syntology_url":"https://syntology.ai/paper/1608.06037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.06037"}}}},{"paper":"/paper/infogan-interpretable-representation-learning","slug":"infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","arxiv_id":"1606.03657","rows_on_this_dataset":1,"code_links":38,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infogan-interpretable-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1606.03657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03657"}}}},{"paper":"/paper/oracle-based-active-set-algorithm-for","slug":"oracle-based-active-set-algorithm-for","title":"Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering","date":"2016-05-09","arxiv_id":"1605.02633","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-unsupervised-learning-of-deep","slug":"joint-unsupervised-learning-of-deep","title":"Joint Unsupervised Learning of Deep Representations and Image Clusters","date":"2016-04-13","arxiv_id":"1604.03628","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jwyang/joint-unsupervised-learning"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/joint-unsupervised-learning-of-deep#ran","syntology_url":"https://syntology.ai/paper/1604.03628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.03628"}}}},{"paper":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}}}},{"paper":"/paper/sparse-activity-and-sparse-connectivity-in","slug":"sparse-activity-and-sparse-connectivity-in","title":"Sparse Activity and Sparse Connectivity in Supervised Learning","date":"2016-03-28","arxiv_id":"1603.08367","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-structured-output-representation","slug":"learning-structured-output-representation","title":"Learning Structured Output Representation using Deep Conditional Generative Models","date":"2015-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unitary-evolution-recurrent-neural-networks","slug":"unitary-evolution-recurrent-neural-networks","title":"Unitary Evolution Recurrent Neural Networks","date":"2015-11-20","arxiv_id":"1511.06464","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unitary-evolution-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.06464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06464"}}}},{"paper":"/paper/all-you-need-is-a-good-init","slug":"all-you-need-is-a-good-init","title":"All you need is a good init","date":"2015-11-19","arxiv_id":"1511.06422","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":19,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":9,"pointer_only_for_licence":2,"official":{"repos":["ducha-aiki/LSUVinit"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/all-you-need-is-a-good-init#ran","syntology_url":"https://syntology.ai/paper/1511.06422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06422"}}}},{"paper":"/paper/convolutional-clustering-for-unsupervised","slug":"convolutional-clustering-for-unsupervised","title":"Convolutional Clustering for Unsupervised Learning","date":"2015-11-19","arxiv_id":"1511.06241","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unsupervised-and-semi-supervised-learning","slug":"unsupervised-and-semi-supervised-learning","title":"Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networks","date":"2015-11-19","arxiv_id":"1511.06390","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","rows_on_this_dataset":1,"code_links":29,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":9,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}}}},{"paper":"/paper/competitive-multi-scale-convolution","slug":"competitive-multi-scale-convolution","title":"Competitive Multi-scale Convolution","date":"2015-11-18","arxiv_id":"1511.05635","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/batch-normalized-maxout-network-in-network","slug":"batch-normalized-maxout-network-in-network","title":"Batch-normalized Maxout Network in Network","date":"2015-11-09","arxiv_id":"1511.02583","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/batch-normalized-maxout-network-in-network#ran","syntology_url":"https://syntology.ai/paper/1511.02583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02583"}}}},{"paper":"/paper/binaryconnect-training-deep-neural-networks","slug":"binaryconnect-training-deep-neural-networks","title":"BinaryConnect: Training Deep Neural Networks with binary weights during propagations","date":"2015-11-02","arxiv_id":"1511.00363","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["MatthieuCourbariaux/BinaryConnect"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/binaryconnect-training-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1511.00363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.00363"}}}},{"paper":"/paper/how-important-is-weight-symmetry-in","slug":"how-important-is-weight-symmetry-in","title":"How Important is Weight Symmetry in Backpropagation?","date":"2015-10-17","arxiv_id":"1510.05067","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/generalizing-pooling-functions-in","slug":"generalizing-pooling-functions-in","title":"Generalizing Pooling Functions in Convolutional Neural Networks: Mixed, Gated, and Tree","date":"2015-09-30","arxiv_id":"1509.08985","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generalizing-pooling-functions-in#ran","syntology_url":"https://syntology.ai/paper/1509.08985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.08985"}}}},{"paper":"/paper/tensorizing-neural-networks","slug":"tensorizing-neural-networks","title":"Tensorizing Neural Networks","date":"2015-09-22","arxiv_id":"1509.06569","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Bihaqo/TensorNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/tensorizing-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1509.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.06569"}}}},{"paper":"/paper/on-the-importance-of-normalisation-layers-in","slug":"on-the-importance-of-normalisation-layers-in","title":"On the Importance of Normalisation Layers in Deep Learning with Piecewise Linear Activation Units","date":"2015-08-03","arxiv_id":"1508.00330","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/training-very-deep-networks","slug":"training-very-deep-networks","title":"Training Very Deep Networks","date":"2015-07-22","arxiv_id":"1507.06228","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/siamese-neural-networks-for-one-shot-image","slug":"siamese-neural-networks-for-one-shot-image","title":"Siamese neural networks for one-shot image recognition","date":"2015-07-10","arxiv_id":null,"rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/stacked-what-where-auto-encoders","slug":"stacked-what-where-auto-encoders","title":"Stacked What-Where Auto-encoders","date":"2015-06-08","arxiv_id":"1506.02351","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/domain-adversarial-training-of-neural","slug":"domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","arxiv_id":"1505.07818","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":52,"samples_ran":35,"samples_constructed":11,"samples_ran_checked":18,"samples_ran_instrument_failed":17,"samples_unverified":17,"pointer_only_for_licence":22,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/domain-adversarial-training-of-neural#ran","syntology_url":"https://syntology.ai/paper/1505.07818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.07818"}}}},{"paper":"/paper/apac-augmented-pattern-classification-with","slug":"apac-augmented-pattern-classification-with","title":"APAC: Augmented PAttern Classification with Neural Networks","date":"2015-05-13","arxiv_id":"1505.03229","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/renet-a-recurrent-neural-network-based","slug":"renet-a-recurrent-neural-network-based","title":"ReNet: A Recurrent Neural Network Based Alternative to Convolutional Networks","date":"2015-05-03","arxiv_id":"1505.00393","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/a-simple-way-to-initialize-recurrent-networks","slug":"a-simple-way-to-initialize-recurrent-networks","title":"A Simple Way to Initialize Recurrent Networks of Rectified Linear Units","date":"2015-04-03","arxiv_id":"1504.00941","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/enhanced-image-classification-with-a-fast","slug":"enhanced-image-classification-with-a-fast","title":"Enhanced Image Classification With a Fast-Learning Shallow Convolutional Neural Network","date":"2015-03-16","arxiv_id":"1503.04596","rows_on_this_dataset":1,"code_links":0,"syntology":null}],"record_sha256":"6b15a7ab2276e286bd29e20c7cff011e8fb1200298c5a91ab1d381290b86cdf4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}