{"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/model/papers/14","list_of":"/task/model","task":"model","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":14,"pages_in_order":55,"rows_per_page":100,"rows":[1301,1400],"of":5434,"counts":{"archive_papers_tagged":5434,"with_a_code_link":1733,"where_syntology_ran_a_sample":517,"not_listed_spam_title":0,"listed":5434,"listed_where_code_ran":517,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":424,"every_run_a_failure_of_syntologys_instrument":93,"listed_with_a_run_with_no_instrument_failure":424,"listed_every_run_a_failure_of_syntologys_instrument":93,"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/model","prev":"/task/model/papers/13","next":"/task/model/papers/15","papers":[{"url":"/paper/hierarchical-infinite-relational-model","slug":"hierarchical-infinite-relational-model","title":"Hierarchical Infinite Relational Model","date":"2021-08-16","arxiv_id":"2108.07208","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/hierarchical-infinite-relational-model#ran","syntology_url":"https://syntology.ai/paper/2108.07208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07208"}},"official":{"repos":["probsys/hierarchical-irm"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/stochastic-deep-model-reference-adaptive","slug":"stochastic-deep-model-reference-adaptive","title":"Stochastic Deep Model Reference Adaptive Control","date":"2021-08-04","arxiv_id":"2108.03120","repositories_listed":1,"syntology":null},{"url":"/paper/pruning-neural-networks-with-interpolative","slug":"pruning-neural-networks-with-interpolative","title":"Model Preserving Compression for Neural Networks","date":"2021-07-30","arxiv_id":"2108.00065","repositories_listed":1,"syntology":null},{"url":"/paper/gabert-an-irish-language-model","slug":"gabert-an-irish-language-model","title":"gaBERT -- an Irish Language Model","date":"2021-07-27","arxiv_id":"2107.12930","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-micro-data-reinforcement-learning-1","slug":"model-based-micro-data-reinforcement-learning-1","title":"Model-based micro-data reinforcement learning: what are the crucial model properties and which model to choose?","date":"2021-07-24","arxiv_id":"2107.11587","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/model-based-micro-data-reinforcement-learning-1#ran","syntology_url":"https://syntology.ai/paper/2107.11587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.11587"}},"official":{"repos":["ramp-kits/rl_simulator"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/a-statistical-model-of-word-rank-evolution","slug":"a-statistical-model-of-word-rank-evolution","title":"A Statistical Model of Word Rank Evolution","date":"2021-07-21","arxiv_id":"2107.09948","repositories_listed":1,"syntology":null},{"url":"/paper/induced-domain-adaptation","slug":"induced-domain-adaptation","title":"Model Transferability With Responsive Decision Subjects","date":"2021-07-13","arxiv_id":"2107.05911","repositories_listed":1,"syntology":null},{"url":"/paper/a-flexible-multi-task-model-for-bert-serving","slug":"a-flexible-multi-task-model-for-bert-serving","title":"A Flexible Multi-Task Model for BERT Serving","date":"2021-07-12","arxiv_id":"2107.05377","repositories_listed":1,"syntology":null},{"url":"/paper/stateful-detection-of-model-extraction","slug":"stateful-detection-of-model-extraction","title":"Stateful Detection of Model Extraction Attacks","date":"2021-07-12","arxiv_id":"2107.05166","repositories_listed":1,"syntology":null},{"url":"/paper/is-a-single-model-enough-mucos-a-multi-model","slug":"is-a-single-model-enough-mucos-a-multi-model","title":"Is a Single Model Enough? MuCoS: A Multi-Model Ensemble Learning for Semantic Code Search","date":"2021-07-10","arxiv_id":"2107.04773","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-process-subspace-regression-for","slug":"gaussian-process-subspace-regression-for","title":"Gaussian Process Subspace Regression for Model Reduction","date":"2021-07-09","arxiv_id":"2107.04668","repositories_listed":1,"syntology":null},{"url":"/paper/redescription-model-mining","slug":"redescription-model-mining","title":"Redescription Model Mining","date":"2021-07-09","arxiv_id":"2107.04462","repositories_listed":1,"syntology":null},{"url":"/paper/does-dataset-complexity-matters-for-model","slug":"does-dataset-complexity-matters-for-model","title":"Does Dataset Complexity Matters for Model Explainers?","date":"2021-07-06","arxiv_id":"2107.02661","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-concept-drift-with-neural-network","slug":"detecting-concept-drift-with-neural-network","title":"Detecting Concept Drift With Neural Network Model Uncertainty","date":"2021-07-05","arxiv_id":"2107.01873","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/detecting-concept-drift-with-neural-network#ran","syntology_url":"https://syntology.ai/paper/2107.01873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01873"}},"official":{"repos":["anonymous-account-research/uncertainty-drift-detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graphical-state-space-model","slug":"graphical-state-space-model","title":"Graphical State Space Model","date":"2021-07-04","arxiv_id":"2107.01602","repositories_listed":1,"syntology":null},{"url":"/paper/mandoline-model-evaluation-under-distribution","slug":"mandoline-model-evaluation-under-distribution","title":"Mandoline: Model Evaluation under Distribution Shift","date":"2021-07-01","arxiv_id":"2107.00643","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mandoline-model-evaluation-under-distribution#ran","syntology_url":"https://syntology.ai/paper/2107.00643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00643"}},"official":{"repos":["HazyResearch/mandoline"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-advantage-optimization-for-model-based","slug":"model-advantage-optimization-for-model-based","title":"Model-Advantage and Value-Aware Models for Model-Based Reinforcement Learning: Bridging the Gap in Theory and Practice","date":"2021-06-26","arxiv_id":"2106.14080","repositories_listed":1,"syntology":null},{"url":"/paper/meaningfully-explaining-a-model-s-mistakes","slug":"meaningfully-explaining-a-model-s-mistakes","title":"Meaningfully Debugging Model Mistakes using Conceptual Counterfactual Explanations","date":"2021-06-24","arxiv_id":"2106.12723","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meaningfully-explaining-a-model-s-mistakes#ran","syntology_url":"https://syntology.ai/paper/2106.12723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12723"}},"official":{"repos":["mertyg/debug-mistakes-cce"],"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"]}}},{"url":"/paper/model-based-reinforcement-learning-via-latent-1","slug":"model-based-reinforcement-learning-via-latent-1","title":"Model-Based Reinforcement Learning via Latent-Space Collocation","date":"2021-06-24","arxiv_id":"2106.13229","repositories_listed":1,"syntology":null},{"url":"/paper/dangers-of-bayesian-model-averaging-under","slug":"dangers-of-bayesian-model-averaging-under","title":"Dangers of Bayesian Model Averaging under Covariate Shift","date":"2021-06-22","arxiv_id":"2106.11905","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dangers-of-bayesian-model-averaging-under#ran","syntology_url":"https://syntology.ai/paper/2106.11905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11905"}},"official":{"repos":["izmailovpavel/bnn_covariate_shift"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/sparsistent-model-discovery","slug":"sparsistent-model-discovery","title":"Sparsistent Model Discovery","date":"2021-06-22","arxiv_id":"2106.11936","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-model-distillation-for-semantic","slug":"probabilistic-model-distillation-for-semantic","title":"Probabilistic Model Distillation for Semantic Correspondence","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explaining-decision-of-model-from-its","slug":"explaining-decision-of-model-from-its","title":"Explaining decision of model from its prediction","date":"2021-06-15","arxiv_id":"2106.08366","repositories_listed":1,"syntology":null},{"url":"/paper/deep-conditional-gaussian-mixture-model-for","slug":"deep-conditional-gaussian-mixture-model-for","title":"Deep Conditional Gaussian Mixture Model for Constrained Clustering","date":"2021-06-11","arxiv_id":"2106.06385","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-for-bayesian-autoencoders","slug":"model-selection-for-bayesian-autoencoders","title":"Model Selection for Bayesian Autoencoders","date":"2021-06-11","arxiv_id":"2106.06245","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-selection-for-bayesian-autoencoders#ran","syntology_url":"https://syntology.ai/paper/2106.06245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06245"}},"official":{"repos":["tranbahien/bae-prior"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-improved-model-for-voicing-silent-speech","slug":"an-improved-model-for-voicing-silent-speech","title":"An Improved Model for Voicing Silent Speech","date":"2021-06-03","arxiv_id":"2106.01933","repositories_listed":1,"syntology":null},{"url":"/paper/shell-theory-a-statistical-model-of-reality","slug":"shell-theory-a-statistical-model-of-reality","title":"Shell Theory: A Statistical Model of Reality","date":"2021-05-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-structural-model-of-business-cards-exchange","slug":"a-structural-model-of-business-cards-exchange","title":"A Structural Model of Business Card Exchange Networks","date":"2021-05-26","arxiv_id":"2105.12704","repositories_listed":1,"syntology":null},{"url":"/paper/retrieval-enhanced-model-for-commonsense","slug":"retrieval-enhanced-model-for-commonsense","title":"Retrieval Enhanced Model for Commonsense Generation","date":"2021-05-24","arxiv_id":"2105.11174","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/retrieval-enhanced-model-for-commonsense#ran","syntology_url":"https://syntology.ai/paper/2105.11174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11174"}},"official":{"repos":["HanNight/RE-T5"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-model-selection-using-learning-curve","slug":"towards-model-selection-using-learning-curve","title":"Towards Model Selection using Learning Curve Cross-Validation","date":"2021-05-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/latent-gaussian-model-boosting","slug":"latent-gaussian-model-boosting","title":"Latent Gaussian Model Boosting","date":"2021-05-19","arxiv_id":"2105.08966","repositories_listed":1,"syntology":null},{"url":"/paper/pathdreamer-a-world-model-for-indoor","slug":"pathdreamer-a-world-model-for-indoor","title":"Pathdreamer: A World Model for Indoor Navigation","date":"2021-05-18","arxiv_id":"2105.08756","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pathdreamer-a-world-model-for-indoor#ran","syntology_url":"https://syntology.ai/paper/2105.08756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08756"}},"official":{"repos":["google-research/pathdreamer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-based-offline-planning-with-trajectory","slug":"model-based-offline-planning-with-trajectory","title":"Model-Based Offline Planning with Trajectory Pruning","date":"2021-05-16","arxiv_id":"2105.07351","repositories_listed":1,"syntology":null},{"url":"/paper/an-intelligent-model-for-solving-manpower","slug":"an-intelligent-model-for-solving-manpower","title":"An Intelligent Model for Solving Manpower Scheduling Problems","date":"2021-05-07","arxiv_id":"2105.03540","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-transferable-model-for-ml-enhanced","slug":"a-unified-transferable-model-for-ml-enhanced","title":"A Unified Transferable Model for ML-Enhanced DBMS","date":"2021-05-06","arxiv_id":"2105.02418","repositories_listed":1,"syntology":null},{"url":"/paper/model-discovery-in-the-sparse-sampling-regime","slug":"model-discovery-in-the-sparse-sampling-regime","title":"Model discovery in the sparse sampling regime","date":"2021-05-02","arxiv_id":"2105.00400","repositories_listed":1,"syntology":null},{"url":"/paper/instance-wise-causal-feature-selection-for","slug":"instance-wise-causal-feature-selection-for","title":"Instance-wise Causal Feature Selection for Model Interpretation","date":"2021-04-26","arxiv_id":"2104.12759","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-cost-design-for-model-predictive","slug":"optimal-cost-design-for-model-predictive","title":"Optimal Cost Design for Model Predictive Control","date":"2021-04-23","arxiv_id":"2104.11353","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-cost-design-for-model-predictive#ran","syntology_url":"https://syntology.ai/paper/2104.11353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.11353"}},"official":{"repos":["avikj/l4dc-mpc-ocd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-model-compression-via-pseudo","slug":"differentiable-model-compression-via-pseudo","title":"Differentiable Model Compression via Pseudo Quantization Noise","date":"2021-04-20","arxiv_id":"2104.09987","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-improves-model","slug":"contrastive-learning-improves-model","title":"Contrastive Learning Improves Model Robustness Under Label Noise","date":"2021-04-19","arxiv_id":"2104.08984","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-learning-improves-model#ran","syntology_url":"https://syntology.ai/paper/2104.08984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08984"}},"official":{"repos":["arghosh/noisy_label_pretrain"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/stylepeople-a-generative-model-of-fullbody","slug":"stylepeople-a-generative-model-of-fullbody","title":"StylePeople: A Generative Model of Fullbody Human Avatars","date":"2021-04-16","arxiv_id":"2104.08363","repositories_listed":1,"syntology":null},{"url":"/paper/a-decomposition-model-for-stereo-matching","slug":"a-decomposition-model-for-stereo-matching","title":"A Decomposition Model for Stereo Matching","date":"2021-04-15","arxiv_id":"2104.07516","repositories_listed":1,"syntology":null},{"url":"/paper/an-adversarial-imitation-click-model-for","slug":"an-adversarial-imitation-click-model-for","title":"An Adversarial Imitation Click Model for Information Retrieval","date":"2021-04-13","arxiv_id":"2104.06077","repositories_listed":1,"syntology":null},{"url":"/paper/building-a-swedish-open-domain-conversational","slug":"building-a-swedish-open-domain-conversational","title":"Building a Swedish Open-Domain Conversational Language Model","date":"2021-04-12","arxiv_id":"2104.05277","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-model-robustness-through-discrete","slug":"achieving-model-robustness-through-discrete","title":"Achieving Model Robustness through Discrete Adversarial Training","date":"2021-04-11","arxiv_id":"2104.05062","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/achieving-model-robustness-through-discrete#ran","syntology_url":"https://syntology.ai/paper/2104.05062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05062"}},"official":{"repos":["Mivg/robust_transformers"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/trajectory-prediction-with-latent-belief","slug":"trajectory-prediction-with-latent-belief","title":"Trajectory Prediction with Latent Belief Energy-Based Model","date":"2021-04-07","arxiv_id":"2104.03086","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-explanations-for-explaining-model","slug":"contrastive-explanations-for-explaining-model","title":"Contrastive Explanations for Explaining Model Adaptations","date":"2021-04-06","arxiv_id":"2104.02459","repositories_listed":1,"syntology":null},{"url":"/paper/model-compression-for-dynamic-forecast","slug":"model-compression-for-dynamic-forecast","title":"Model Compression for Dynamic Forecast Combination","date":"2021-04-05","arxiv_id":"2104.01830","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-entity-and-relation-extraction","slug":"multilingual-entity-and-relation-extraction","title":"Multilingual Entity and Relation Extraction Dataset and Model","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/model-based-clustering-of-partial-records","slug":"model-based-clustering-of-partial-records","title":"Fast model-based clustering of partial records","date":"2021-03-30","arxiv_id":"2103.16336","repositories_listed":1,"syntology":null},{"url":"/paper/deep-compression-for-pytorch-model-deployment","slug":"deep-compression-for-pytorch-model-deployment","title":"Deep Compression for PyTorch Model Deployment on Microcontrollers","date":"2021-03-29","arxiv_id":"2103.15972","repositories_listed":1,"syntology":null},{"url":"/paper/robust-reinforcement-learning-under-model","slug":"robust-reinforcement-learning-under-model","title":"Robust Reinforcement Learning under model misspecification","date":"2021-03-29","arxiv_id":"2103.15370","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-model-exploration-for-tumor","slug":"parallel-model-exploration-for-tumor","title":"Parallel Model Exploration for Tumor Treatment Simulations","date":"2021-03-25","arxiv_id":"2103.14132","repositories_listed":1,"syntology":null},{"url":"/paper/czert-czech-bert-like-model-for-language","slug":"czert-czech-bert-like-model-for-language","title":"Czert -- Czech BERT-like Model for Language Representation","date":"2021-03-24","arxiv_id":"2103.13031","repositories_listed":1,"syntology":null},{"url":"/paper/cnn-model-tuning-for-global-road-damage","slug":"cnn-model-tuning-for-global-road-damage","title":"CNN Model & Tuning for Global Road Damage Detection","date":"2021-03-17","arxiv_id":"2103.09512","repositories_listed":1,"syntology":null},{"url":"/paper/robust-model-compression-using-deep","slug":"robust-model-compression-using-deep","title":"Robust Model Compression Using Deep Hypotheses","date":"2021-03-13","arxiv_id":"2103.07668","repositories_listed":1,"syntology":null},{"url":"/paper/smplicit-topology-aware-generative-model-for","slug":"smplicit-topology-aware-generative-model-for","title":"SMPLicit: Topology-aware Generative Model for Clothed People","date":"2021-03-11","arxiv_id":"2103.06871","repositories_listed":1,"syntology":null},{"url":"/paper/sensitivity-analysis-of-an-integrated-climate","slug":"sensitivity-analysis-of-an-integrated-climate","title":"Sensitivity analysis of an integrated climate-economic model","date":"2021-03-10","arxiv_id":"2103.06227","repositories_listed":1,"syntology":null},{"url":"/paper/active-testing-sample-efficient-model","slug":"active-testing-sample-efficient-model","title":"Active Testing: Sample-Efficient Model Evaluation","date":"2021-03-09","arxiv_id":"2103.05331","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/active-testing-sample-efficient-model#ran","syntology_url":"https://syntology.ai/paper/2103.05331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05331"}},"official":{"repos":["jlko/active-testing"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-free-policy-learning-with-reward","slug":"model-free-policy-learning-with-reward","title":"Model-free Policy Learning with Reward Gradients","date":"2021-03-09","arxiv_id":"2103.05147","repositories_listed":1,"syntology":null},{"url":"/paper/towards-action-model-learning-for-player","slug":"towards-action-model-learning-for-player","title":"Towards Action Model Learning for Player Modeling","date":"2021-03-09","arxiv_id":"2103.05682","repositories_listed":1,"syntology":null},{"url":"/paper/deep-model-intellectual-property-protection","slug":"deep-model-intellectual-property-protection","title":"Deep Model Intellectual Property Protection via Deep Watermarking","date":"2021-03-08","arxiv_id":"2103.04980","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-explanations-for-model","slug":"contrastive-explanations-for-model","title":"Contrastive Explanations for Model Interpretability","date":"2021-03-02","arxiv_id":"2103.01378","repositories_listed":1,"syntology":null},{"url":"/paper/deep-quantile-aggregation","slug":"deep-quantile-aggregation","title":"Flexible Model Aggregation for Quantile Regression","date":"2021-02-26","arxiv_id":"2103.00083","repositories_listed":1,"syntology":null},{"url":"/paper/nomu-neural-optimization-based-model","slug":"nomu-neural-optimization-based-model","title":"NOMU: Neural Optimization-based Model Uncertainty","date":"2021-02-26","arxiv_id":"2102.13640","repositories_listed":1,"syntology":null},{"url":"/paper/deep-stochastic-volatility-model","slug":"deep-stochastic-volatility-model","title":"Deep Stochastic Volatility Model","date":"2021-02-25","arxiv_id":"2102.12658","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-domain-generalization","slug":"model-based-domain-generalization","title":"Model-Based Domain Generalization","date":"2021-02-23","arxiv_id":"2102.11436","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-multi-destination-trips-with-sketch","slug":"modeling-multi-destination-trips-with-sketch","title":"Modeling Multi-Destination Trips with Sketch-Based Model","date":"2021-02-22","arxiv_id":"2102.11252","repositories_listed":1,"syntology":null},{"url":"/paper/optimism-is-all-you-need-model-based","slug":"optimism-is-all-you-need-model-based","title":"MobILE: Model-Based Imitation Learning From Observation Alone","date":"2021-02-22","arxiv_id":"2102.10769","repositories_listed":1,"syntology":null},{"url":"/paper/electromagnetic-model-of-reflective","slug":"electromagnetic-model-of-reflective","title":"Electromagnetic Model of Reflective Intelligent Surfaces","date":"2021-02-21","arxiv_id":"2102.10666","repositories_listed":1,"syntology":null},{"url":"/paper/successive-pruning-for-model-compression-via","slug":"successive-pruning-for-model-compression-via","title":"An Information-Theoretic Justification for Model Pruning","date":"2021-02-16","arxiv_id":"2102.08329","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-time-model-based-reinforcement","slug":"continuous-time-model-based-reinforcement","title":"Continuous-Time Model-Based Reinforcement Learning","date":"2021-02-09","arxiv_id":"2102.04764","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-multi-parameter-mapping","slug":"model-based-multi-parameter-mapping","title":"Model-based multi-parameter mapping","date":"2021-02-02","arxiv_id":"2102.01604","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-model-predictive-control-a","slug":"stochastic-model-predictive-control-a","title":"(Stochastic) Model Predictive Control -- a Simulation Example","date":"2021-01-28","arxiv_id":"2101.12020","repositories_listed":1,"syntology":null},{"url":"/paper/a-shallow-neural-model-for-relation","slug":"a-shallow-neural-model-for-relation","title":"A shallow neural model for relation prediction","date":"2021-01-22","arxiv_id":"2101.09090","repositories_listed":1,"syntology":null},{"url":"/paper/expfinder-an-ensemble-expert-finding-model","slug":"expfinder-an-ensemble-expert-finding-model","title":"ExpFinder: An Ensemble Expert Finding Model Integrating $N$-gram Vector Space Model and $μ$CO-HITS","date":"2021-01-18","arxiv_id":"2101.06821","repositories_listed":1,"syntology":null},{"url":"/paper/shallow-uwnet-compressed-model-for-underwater","slug":"shallow-uwnet-compressed-model-for-underwater","title":"Shallow-UWnet : Compressed Model for Underwater Image Enhancement","date":"2021-01-06","arxiv_id":"2101.02073","repositories_listed":1,"syntology":null},{"url":"/paper/minimum-viable-model-estimates-for-machine","slug":"minimum-viable-model-estimates-for-machine","title":"Minimum Viable Model Estimates for Machine Learning Projects","date":"2021-01-02","arxiv_id":"2101.00346","repositories_listed":1,"syntology":null},{"url":"/paper/model-free-energy-distance-for-pruning-dnns","slug":"model-free-energy-distance-for-pruning-dnns","title":"Model-Free Energy Distance for Pruning DNNs","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/syntax-enhanced-pre-trained-model","slug":"syntax-enhanced-pre-trained-model","title":"Syntax-Enhanced Pre-trained Model","date":"2020-12-28","arxiv_id":"2012.14116","repositories_listed":1,"syntology":null},{"url":"/paper/an-embarrassingly-simple-model-for-dialogue","slug":"an-embarrassingly-simple-model-for-dialogue","title":"An Embarrassingly Simple Model for Dialogue Relation Extraction","date":"2020-12-27","arxiv_id":"2012.13873","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-neural-architecture-using-one-shot","slug":"evolving-neural-architecture-using-one-shot","title":"Evolving Neural Architecture Using One Shot Model","date":"2020-12-23","arxiv_id":"2012.12540","repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-spomdp-environment-modeling-with","slug":"autonomous-spomdp-environment-modeling-with","title":"Autonomous sPOMDP Environment Modeling With Partial Model Exploitation","date":"2020-12-22","arxiv_id":"2012.12203","repositories_listed":1,"syntology":null},{"url":"/paper/model-free-and-bayesian-ensembling-model","slug":"model-free-and-bayesian-ensembling-model","title":"Model-free and Bayesian Ensembling Model-based Deep Reinforcement Learning for Particle Accelerator Control Demonstrated on the FERMI FEL","date":"2020-12-17","arxiv_id":"2012.09737","repositories_listed":1,"syntology":null},{"url":"/paper/speech-enhancement-with-zero-shot-model","slug":"speech-enhancement-with-zero-shot-model","title":"Speech Enhancement with Zero-Shot Model Selection","date":"2020-12-17","arxiv_id":"2012.09359","repositories_listed":1,"syntology":null},{"url":"/paper/a-lightweight-neural-model-for-biomedical","slug":"a-lightweight-neural-model-for-biomedical","title":"A Lightweight Neural Model for Biomedical Entity Linking","date":"2020-12-16","arxiv_id":"2012.08844","repositories_listed":1,"syntology":null},{"url":"/paper/on-exploiting-hitting-sets-for-model","slug":"on-exploiting-hitting-sets-for-model","title":"On Exploiting Hitting Sets for Model Reconciliation","date":"2020-12-16","arxiv_id":"2012.09274","repositories_listed":1,"syntology":null},{"url":"/paper/keyword-guided-neural-conversational-model","slug":"keyword-guided-neural-conversational-model","title":"Keyword-Guided Neural Conversational Model","date":"2020-12-15","arxiv_id":"2012.08383","repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-neighborhood-matching-model","slug":"relation-aware-neighborhood-matching-model","title":"Relation-Aware Neighborhood Matching Model for Entity Alignment","date":"2020-12-15","arxiv_id":"2012.08128","repositories_listed":1,"syntology":null},{"url":"/paper/improving-model-calibration-with-accuracy-1","slug":"improving-model-calibration-with-accuracy-1","title":"Improving model calibration with accuracy versus uncertainty optimization","date":"2020-12-14","arxiv_id":"2012.07923","repositories_listed":1,"syntology":null},{"url":"/paper/meme-generating-rnn-model-explanations-via","slug":"meme-generating-rnn-model-explanations-via","title":"MEME: Generating RNN Model Explanations via Model Extraction","date":"2020-12-13","arxiv_id":"2012.06954","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":5,"n_ran_checked":5,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":14,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/meme-generating-rnn-model-explanations-via#ran","syntology_url":"https://syntology.ai/paper/2012.06954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06954"}},"official":{"repos":["dmitrykazhdan/MEME-RNN-XAI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-reduced-order-model-predictive-control","slug":"linear-reduced-order-model-predictive-control","title":"Linear Reduced Order Model Predictive Control","date":"2020-12-06","arxiv_id":"2012.03384","repositories_listed":1,"syntology":null},{"url":"/paper/concept-based-model-explanations-for","slug":"concept-based-model-explanations-for","title":"Concept-based model explanations for Electronic Health Records","date":"2020-12-03","arxiv_id":"2012.02308","repositories_listed":1,"syntology":null},{"url":"/paper/fairbatch-batch-selection-for-model-fairness-1","slug":"fairbatch-batch-selection-for-model-fairness-1","title":"FairBatch: Batch Selection for Model Fairness","date":"2020-12-03","arxiv_id":"2012.01696","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/fairbatch-batch-selection-for-model-fairness-1#ran","syntology_url":"https://syntology.ai/paper/2012.01696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01696"}},"official":{"repos":["yuji-roh/fairbatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-class-reliance-for-random-forests","slug":"model-class-reliance-for-random-forests","title":"Model Class Reliance for Random Forests","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semantic-triples-verbalization-with","slug":"semantic-triples-verbalization-with","title":"Semantic Triples Verbalization with Generative Pre-Training Model","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/statistical-model-based-evaluation-of-neural","slug":"statistical-model-based-evaluation-of-neural","title":"Statistical model-based evaluation of neural networks","date":"2020-11-18","arxiv_id":"2011.09015","repositories_listed":1,"syntology":null},{"url":"/paper/learn-an-effective-lip-reading-model-without","slug":"learn-an-effective-lip-reading-model-without","title":"Learn an Effective Lip Reading Model without Pains","date":"2020-11-15","arxiv_id":"2011.07557","repositories_listed":1,"syntology":null},{"url":"/paper/online-ensemble-model-compression-using-1","slug":"online-ensemble-model-compression-using-1","title":"Online Ensemble Model Compression using Knowledge Distillation","date":"2020-11-15","arxiv_id":"2011.07449","repositories_listed":1,"syntology":null},{"url":"/paper/debugging-tests-for-model-explanations","slug":"debugging-tests-for-model-explanations","title":"Debugging Tests for Model Explanations","date":"2020-11-10","arxiv_id":"2011.05429","repositories_listed":1,"syntology":null}],"record_sha256":"14d0948d3995f4db819aad40c9884c71c0a18e1cff4291f68b49496f89ebf5af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}