{"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-selection","name":"Model Selection","slug":"model-selection","description_markdown":"Given a set of candidate models, the goal of **Model Selection** is to select the model that best approximates the observed data and captures its underlying regularities. Model Selection criteria are defined such that they strike a balance between the goodness of fit, and the generalizability or complexity of the models.\n\n\n<span class=\"description-source\">Source: [Kernel-based Information Criterion ](https://arxiv.org/abs/1408.5810)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":2050,"papers_with_code":658,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/image-caption-quality-dataset","name":"Image Caption Quality Dataset","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":21,"rows_per_page":100,"shown":100,"of":2050,"of_with_code":658,"tagged_in_all":2050,"counts":{"archive_papers_tagged":2050,"with_a_code_link":658,"where_syntology_ran_a_sample":141,"not_listed_spam_title":0,"listed":2050,"listed_where_code_ran":141,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":114,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":114,"listed_every_run_a_failure_of_syntologys_instrument":27,"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"},"items":[{"url":"/paper/bertscore-evaluating-text-generation-with","slug":"bertscore-evaluating-text-generation-with","title":"BERTScore: Evaluating Text Generation with BERT","date":"2019-04-21","arxiv_id":"1904.09675","repositories_listed":20,"syntology":{"n":76,"n_ran":44,"n_constructed":4,"n_ran_checked":10,"n_instrument":34,"n_unverified":32,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":33,"phrase":"44 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 34 where Syntology's instrument failed) · 32 unverified","sample_list":"/paper/bertscore-evaluating-text-generation-with#ran","syntology_url":"https://syntology.ai/paper/1904.09675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09675"}},"official":{"repos":["Tiiiger/bert_score"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/in-search-of-lost-domain-generalization","slug":"in-search-of-lost-domain-generalization","title":"In Search of Lost Domain Generalization","date":"2020-07-02","arxiv_id":"2007.01434","repositories_listed":12,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/in-search-of-lost-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2007.01434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01434"}},"official":{"repos":["facebookresearch/DomainBed"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/population-based-training-of-neural-networks","slug":"population-based-training-of-neural-networks","title":"Population Based Training of Neural Networks","date":"2017-11-27","arxiv_id":"1711.09846","repositories_listed":9,"syntology":null},{"url":"/paper/data-splits-and-metrics-for-method","slug":"data-splits-and-metrics-for-method","title":"Data Splits and Metrics for Method Benchmarking on Surgical Action Triplet Datasets","date":"2022-04-11","arxiv_id":"2204.05235","repositories_listed":8,"syntology":null},{"url":"/paper/deep-domain-confusion-maximizing-for-domain","slug":"deep-domain-confusion-maximizing-for-domain","title":"Deep Domain Confusion: Maximizing for Domain Invariance","date":"2014-12-10","arxiv_id":"1412.3474","repositories_listed":7,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/deep-domain-confusion-maximizing-for-domain#ran","syntology_url":"https://syntology.ai/paper/1412.3474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.3474"}},"official":null}},{"url":"/paper/laplace-redux-effortless-bayesian-deep","slug":"laplace-redux-effortless-bayesian-deep","title":"Laplace Redux -- Effortless Bayesian Deep Learning","date":"2021-06-28","arxiv_id":"2106.14806","repositories_listed":6,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/laplace-redux-effortless-bayesian-deep#ran","syntology_url":"https://syntology.ai/paper/2106.14806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14806"}},"official":{"repos":["AlexImmer/Laplace","runame/laplace-redux"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/metric-learn-metric-learning-algorithms-in","slug":"metric-learn-metric-learning-algorithms-in","title":"metric-learn: Metric Learning Algorithms in Python","date":"2019-08-13","arxiv_id":"1908.04710","repositories_listed":6,"syntology":null},{"url":"/paper/conditional-density-estimation-tools-in","slug":"conditional-density-estimation-tools-in","title":"Conditional Density Estimation Tools in Python and R with Applications to Photometric Redshifts and Likelihood-Free Cosmological Inference","date":"2019-08-30","arxiv_id":"1908.11523","repositories_listed":5,"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":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) · 2 unverified","sample_list":"/paper/conditional-density-estimation-tools-in#ran","syntology_url":"https://syntology.ai/paper/1908.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11523"}},"official":{"repos":["Mr8ND/cdetools_applications","tpospisi/DeepCDE","tpospisi/NNKCDE","tpospisi/cdetools","tpospisi/rfcde"],"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/barcodebert-transformers-for-biodiversity","slug":"barcodebert-transformers-for-biodiversity","title":"BarcodeBERT: Transformers for Biodiversity Analysis","date":"2023-11-04","arxiv_id":"2311.02401","repositories_listed":4,"syntology":{"n":16,"n_ran":12,"n_constructed":1,"n_ran_checked":11,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/barcodebert-transformers-for-biodiversity#ran","syntology_url":"https://syntology.ai/paper/2311.02401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02401"}},"official":{"repos":["bioscan-ml/barcodebert","kari-genomics-lab/barcodebert"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/testing-conditional-predictive-independence","slug":"testing-conditional-predictive-independence","title":"Testing Conditional Independence in Supervised Learning Algorithms","date":"2019-01-28","arxiv_id":"1901.09917","repositories_listed":4,"syntology":null},{"url":"/paper/model-evaluation-model-selection-and","slug":"model-evaluation-model-selection-and","title":"Model Evaluation, Model Selection, and Algorithm Selection in Machine Learning","date":"2018-11-13","arxiv_id":"1811.12808","repositories_listed":4,"syntology":null},{"url":"/paper/variational-bayesian-monte-carlo","slug":"variational-bayesian-monte-carlo","title":"Variational Bayesian Monte Carlo","date":"2018-10-12","arxiv_id":"1810.05558","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variational-bayesian-monte-carlo#ran","syntology_url":"https://syntology.ai/paper/1810.05558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05558"}},"official":{"repos":["lacerbi/infbench","lacerbi/vbmc"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/tune-a-research-platform-for-distributed","slug":"tune-a-research-platform-for-distributed","title":"Tune: A Research Platform for Distributed Model Selection and Training","date":"2018-07-13","arxiv_id":"1807.05118","repositories_listed":4,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/tune-a-research-platform-for-distributed#ran","syntology_url":"https://syntology.ai/paper/1807.05118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05118"}},"official":null}},{"url":"/paper/learning-sparse-neural-networks-through-l_0","slug":"learning-sparse-neural-networks-through-l_0","title":"Learning Sparse Neural Networks through $L_0$ Regularization","date":"2017-12-04","arxiv_id":"1712.01312","repositories_listed":4,"syntology":null},{"url":"/paper/neural-vector-spaces-for-unsupervised","slug":"neural-vector-spaces-for-unsupervised","title":"Neural Vector Spaces for Unsupervised Information Retrieval","date":"2017-08-09","arxiv_id":"1708.02702","repositories_listed":4,"syntology":null},{"url":"/paper/encoder-vs-decoder-comparative-analysis-of","slug":"encoder-vs-decoder-comparative-analysis-of","title":"Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks","date":"2024-06-19","arxiv_id":"2406.13469","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/encoder-vs-decoder-comparative-analysis-of#ran","syntology_url":"https://syntology.ai/paper/2406.13469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13469"}},"official":null}},{"url":"/paper/the-future-of-cosmological-likelihood-based","slug":"the-future-of-cosmological-likelihood-based","title":"The future of cosmological likelihood-based inference: accelerated high-dimensional parameter estimation and model comparison","date":"2024-05-21","arxiv_id":"2405.12965","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-future-of-cosmological-likelihood-based#ran","syntology_url":"https://syntology.ai/paper/2405.12965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12965"}},"official":{"repos":["alessiospuriomancini/cosmopower","astro-informatics/harmonic","dpiras/cosmopower-jax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-learning-method-for-comparing-bayesian","slug":"a-deep-learning-method-for-comparing-bayesian","title":"A Deep Learning Method for Comparing Bayesian Hierarchical Models","date":"2023-01-27","arxiv_id":"2301.11873","repositories_listed":3,"syntology":null},{"url":"/paper/leather-a-framework-for-learning-to-generate","slug":"leather-a-framework-for-learning-to-generate","title":"LEATHER: A Framework for Learning to Generate Human-like Text in Dialogue","date":"2022-10-14","arxiv_id":"2210.07777","repositories_listed":3,"syntology":null},{"url":"/paper/volcanoml-speeding-up-end-to-end-automl-via","slug":"volcanoml-speeding-up-end-to-end-automl-via","title":"VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition","date":"2021-07-19","arxiv_id":"2107.08861","repositories_listed":3,"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":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) · 2 unverified","sample_list":"/paper/volcanoml-speeding-up-end-to-end-automl-via#ran","syntology_url":"https://syntology.ai/paper/2107.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08861"}},"official":{"repos":["PKU-DAIR/mindware"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/otce-a-transferability-metric-for-cross","slug":"otce-a-transferability-metric-for-cross","title":"OTCE: A Transferability Metric for Cross-Domain Cross-Task Representations","date":"2021-03-25","arxiv_id":"2103.13843","repositories_listed":3,"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":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) · 0 unverified","sample_list":"/paper/otce-a-transferability-metric-for-cross#ran","syntology_url":"https://syntology.ai/paper/2103.13843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13843"}},"official":{"repos":["tanyang1231/OTCE_Transferability_CVPR21"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/cardea-an-open-automated-machine-learning","slug":"cardea-an-open-automated-machine-learning","title":"Cardea: An Open Automated Machine Learning Framework for Electronic Health Records","date":"2020-10-01","arxiv_id":"2010.00509","repositories_listed":3,"syntology":null},{"url":"/paper/statistical-inference-of-minimally-complex","slug":"statistical-inference-of-minimally-complex","title":"Bayesian Inference of Minimally Complex Models with Interactions of Arbitrary Order","date":"2020-08-02","arxiv_id":"2008.00520","repositories_listed":3,"syntology":null},{"url":"/paper/automatic-catalog-of-rrlyrae-from-sim-14","slug":"automatic-catalog-of-rrlyrae-from-sim-14","title":"Automatic Catalog of RRLyrae from $\\sim$ 14 million VVV Light Curves: How far can we go with traditional machine-learning?","date":"2020-05-01","arxiv_id":"2005.00220","repositories_listed":3,"syntology":null},{"url":"/paper/deep-learning-algorithms-for-rotating","slug":"deep-learning-algorithms-for-rotating","title":"Deep Learning Algorithms for Rotating Machinery Intelligent Diagnosis: An Open Source Benchmark Study","date":"2020-03-06","arxiv_id":"2003.03315","repositories_listed":3,"syntology":null},{"url":"/paper/predictive-multiplicity-in-classification","slug":"predictive-multiplicity-in-classification","title":"Predictive Multiplicity in Classification","date":"2019-09-14","arxiv_id":"1909.06677","repositories_listed":3,"syntology":null},{"url":"/paper/interpretable-multiclass-classification-by","slug":"interpretable-multiclass-classification-by","title":"Interpretable multiclass classification by MDL-based rule lists","date":"2019-05-01","arxiv_id":"1905.00328","repositories_listed":3,"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":0,"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/interpretable-multiclass-classification-by#ran","syntology_url":"https://syntology.ai/paper/1905.00328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00328"}},"official":{"repos":["HMProenca/RuleList"],"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/forecasting-with-time-series-imaging","slug":"forecasting-with-time-series-imaging","title":"Forecasting with time series imaging","date":"2019-04-17","arxiv_id":"1904.08064","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forecasting-with-time-series-imaging#ran","syntology_url":"https://syntology.ai/paper/1904.08064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08064"}},"official":{"repos":["lixixibj/forecasting-with-time-series-imaging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-gradient-boosting","slug":"automatic-gradient-boosting","title":"Automatic Gradient Boosting","date":"2018-07-10","arxiv_id":"1807.03873","repositories_listed":3,"syntology":null},{"url":"/paper/a-comparison-of-methods-for-model-selection","slug":"a-comparison-of-methods-for-model-selection","title":"A comparison of methods for model selection when estimating individual treatment effects","date":"2018-04-14","arxiv_id":"1804.05146","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comparison-of-methods-for-model-selection#ran","syntology_url":"https://syntology.ai/paper/1804.05146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05146"}},"official":{"repos":["som-shahlab/ITE-model-selection"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/hybridsvd-when-collaborative-information-is","slug":"hybridsvd-when-collaborative-information-is","title":"HybridSVD: When Collaborative Information is Not Enough","date":"2018-02-18","arxiv_id":"1802.06398","repositories_listed":3,"syntology":null},{"url":"/paper/scikit-learn-machine-learning-in-python","slug":"scikit-learn-machine-learning-in-python","title":"Scikit-learn: Machine Learning in Python","date":"2012-01-02","arxiv_id":"1201.0490","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scikit-learn-machine-learning-in-python#ran","syntology_url":"https://syntology.ai/paper/1201.0490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1201.0490"}},"official":null}},{"url":"/paper/large-scale-correlation-clustering","slug":"large-scale-correlation-clustering","title":"Large Scale Correlation Clustering Optimization","date":"2011-12-13","arxiv_id":"1112.2903","repositories_listed":3,"syntology":null},{"url":"/paper/stochastic-gradient-descent-estimation-of","slug":"stochastic-gradient-descent-estimation-of","title":"Stochastic gradient descent estimation of generalized matrix factorization models with application to single-cell RNA sequencing data","date":"2024-12-29","arxiv_id":"2412.20509","repositories_listed":2,"syntology":null},{"url":"/paper/ad-llm-benchmarking-large-language-models-for","slug":"ad-llm-benchmarking-large-language-models-for","title":"AD-LLM: Benchmarking Large Language Models for Anomaly Detection","date":"2024-12-15","arxiv_id":"2412.11142","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/ad-llm-benchmarking-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2412.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.11142"}},"official":{"repos":["usc-fortis/ad-llm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-language-models-as-synthetic-data","slug":"evaluating-language-models-as-synthetic-data","title":"Evaluating Language Models as Synthetic Data Generators","date":"2024-12-04","arxiv_id":"2412.03679","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/evaluating-language-models-as-synthetic-data#ran","syntology_url":"https://syntology.ai/paper/2412.03679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03679"}},"official":{"repos":["neulab/data-agora"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/axiomvision-accuracy-guaranteed-adaptive","slug":"axiomvision-accuracy-guaranteed-adaptive","title":"AxiomVision: Accuracy-Guaranteed Adaptive Visual Model Selection for Perspective-Aware Video Analytics","date":"2024-07-29","arxiv_id":"2407.20124","repositories_listed":2,"syntology":null},{"url":"/paper/tabred-a-benchmark-of-tabular-machine","slug":"tabred-a-benchmark-of-tabular-machine","title":"TabReD: Analyzing Pitfalls and Filling the Gaps in Tabular Deep Learning Benchmarks","date":"2024-06-27","arxiv_id":"2406.19380","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 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; 7 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/tabred-a-benchmark-of-tabular-machine#ran","syntology_url":"https://syntology.ai/paper/2406.19380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19380"}},"official":{"repos":["yandex-research/tabred"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/aeon-a-python-toolkit-for-learning-from-time","slug":"aeon-a-python-toolkit-for-learning-from-time","title":"aeon: a Python toolkit for learning from time series","date":"2024-06-20","arxiv_id":"2406.14231","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/aeon-a-python-toolkit-for-learning-from-time#ran","syntology_url":"https://syntology.ai/paper/2406.14231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14231"}},"official":{"repos":["aeon-toolkit/aeon"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/defining-expertise-applications-to-treatment","slug":"defining-expertise-applications-to-treatment","title":"Defining Expertise: Applications to Treatment Effect Estimation","date":"2024-03-01","arxiv_id":"2403.00694","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"11 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/defining-expertise-applications-to-treatment#ran","syntology_url":"https://syntology.ai/paper/2403.00694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00694"}},"official":{"repos":["qiyaowei/expertise","vanderschaarlab/expertise"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reimagining-synthetic-tabular-data-generation-1","slug":"reimagining-synthetic-tabular-data-generation-1","title":"Reimagining Synthetic Tabular Data Generation through Data-Centric AI: A Comprehensive Benchmark","date":"2023-10-25","arxiv_id":"2310.16981","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reimagining-synthetic-tabular-data-generation-1#ran","syntology_url":"https://syntology.ai/paper/2310.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16981"}},"official":{"repos":["hlasse/data-centric-synthetic-data","vanderschaarlab/data-centric-synthetic-data"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-matrix-flows-for-gaussian-1","slug":"conditional-matrix-flows-for-gaussian-1","title":"Conditional Matrix Flows for Gaussian Graphical Models","date":"2023-06-12","arxiv_id":"2306.07255","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conditional-matrix-flows-for-gaussian-1#ran","syntology_url":"https://syntology.ai/paper/2306.07255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07255"}},"official":{"repos":["fabricioarendtorres/flowconductor","marcello-negri/cmf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uni-qsar-an-auto-ml-tool-for-molecular","slug":"uni-qsar-an-auto-ml-tool-for-molecular","title":"Uni-QSAR: an Auto-ML Tool for Molecular Property Prediction","date":"2023-04-24","arxiv_id":"2304.12239","repositories_listed":2,"syntology":null},{"url":"/paper/an-offline-metric-for-the-debiasedness-of","slug":"an-offline-metric-for-the-debiasedness-of","title":"An Offline Metric for the Debiasedness of Click Models","date":"2023-04-19","arxiv_id":"2304.09560","repositories_listed":2,"syntology":null},{"url":"/paper/change-is-hard-a-closer-look-at-subpopulation","slug":"change-is-hard-a-closer-look-at-subpopulation","title":"Change is Hard: A Closer Look at Subpopulation Shift","date":"2023-02-23","arxiv_id":"2302.12254","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/change-is-hard-a-closer-look-at-subpopulation#ran","syntology_url":"https://syntology.ai/paper/2302.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12254"}},"official":{"repos":["yyzharry/subpopbench"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/specializing-smaller-language-models-towards","slug":"specializing-smaller-language-models-towards","title":"Specializing Smaller Language Models towards Multi-Step Reasoning","date":"2023-01-30","arxiv_id":"2301.12726","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/specializing-smaller-language-models-towards#ran","syntology_url":"https://syntology.ai/paper/2301.12726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12726"}},"official":{"repos":["FranxYao/FlanT5-CoT-Specialization"],"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"]}}},{"url":"/paper/transformers-as-algorithms-generalization-and","slug":"transformers-as-algorithms-generalization-and","title":"Transformers as Algorithms: Generalization and Stability in In-context Learning","date":"2023-01-17","arxiv_id":"2301.07067","repositories_listed":2,"syntology":null},{"url":"/paper/data-iq-characterizing-subgroups-with","slug":"data-iq-characterizing-subgroups-with","title":"Data-IQ: Characterizing subgroups with heterogeneous outcomes in tabular data","date":"2022-10-24","arxiv_id":"2210.13043","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/data-iq-characterizing-subgroups-with#ran","syntology_url":"https://syntology.ai/paper/2210.13043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13043"}},"official":{"repos":["seedatnabeel/data-iq","vanderschaarlab/data-iq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/multiplicity-adjusted-bootstrap-tilting-lower","slug":"multiplicity-adjusted-bootstrap-tilting-lower","title":"Post-Selection Confidence Bounds for Prediction Performance","date":"2022-10-24","arxiv_id":"2210.13206","repositories_listed":2,"syntology":null},{"url":"/paper/synthetic-model-combination-an-instance-wise","slug":"synthetic-model-combination-an-instance-wise","title":"Synthetic Model Combination: An Instance-wise Approach to Unsupervised Ensemble Learning","date":"2022-10-11","arxiv_id":"2210.05320","repositories_listed":2,"syntology":null},{"url":"/paper/medfair-benchmarking-fairness-for-medical","slug":"medfair-benchmarking-fairness-for-medical","title":"MEDFAIR: Benchmarking Fairness for Medical Imaging","date":"2022-10-04","arxiv_id":"2210.01725","repositories_listed":2,"syntology":null},{"url":"/paper/a-new-family-of-constitutive-artificial","slug":"a-new-family-of-constitutive-artificial","title":"A new family of Constitutive Artificial Neural Networks towards automated model discovery","date":"2022-09-15","arxiv_id":"2210.02202","repositories_listed":2,"syntology":null},{"url":"/paper/clusterbma-bayesian-model-averaging-for","slug":"clusterbma-bayesian-model-averaging-for","title":"clusterBMA: Bayesian model averaging for clustering","date":"2022-09-09","arxiv_id":"2209.04117","repositories_listed":2,"syntology":null},{"url":"/paper/nico-towards-better-benchmarking-for-domain","slug":"nico-towards-better-benchmarking-for-domain","title":"NICO++: Towards Better Benchmarking for Domain Generalization","date":"2022-04-17","arxiv_id":"2204.08040","repositories_listed":2,"syntology":null},{"url":"/paper/rich-feature-construction-for-the","slug":"rich-feature-construction-for-the","title":"Rich Feature Construction for the Optimization-Generalization Dilemma","date":"2022-03-24","arxiv_id":"2203.15516","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rich-feature-construction-for-the#ran","syntology_url":"https://syntology.ai/paper/2203.15516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15516"}},"official":{"repos":["tjujianyu/rfc"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/joint-inference-for-neural-network-depth-and","slug":"joint-inference-for-neural-network-depth-and","title":"Joint Inference for Neural Network Depth and Dropout Regularization","date":"2021-11-08","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-learning-on-time-series-method-and","slug":"adaptive-learning-on-time-series-method-and","title":"DMS, AE, DAA: methods and applications of adaptive time series model selection, ensemble, and financial evaluation","date":"2021-10-21","arxiv_id":"2110.11156","repositories_listed":2,"syntology":null},{"url":"/paper/abess-a-fast-best-subset-selection-library-in","slug":"abess-a-fast-best-subset-selection-library-in","title":"abess: A Fast Best Subset Selection Library in Python and R","date":"2021-10-19","arxiv_id":"2110.09697","repositories_listed":2,"syntology":null},{"url":"/paper/caloflow-fast-and-accurate-generation-of","slug":"caloflow-fast-and-accurate-generation-of","title":"CaloFlow: Fast and Accurate Generation of Calorimeter Showers with Normalizing Flows","date":"2021-06-09","arxiv_id":"2106.05285","repositories_listed":2,"syntology":null},{"url":"/paper/duality-diagram-similarity-a-generic","slug":"duality-diagram-similarity-a-generic","title":"Duality Diagram Similarity: a generic framework for initialization selection in task transfer learning","date":"2020-08-05","arxiv_id":"2008.02107","repositories_listed":2,"syntology":null},{"url":"/paper/evaluation-for-weakly-supervised-object","slug":"evaluation-for-weakly-supervised-object","title":"Evaluation for Weakly Supervised Object Localization: Protocol, Metrics, and Datasets","date":"2020-07-08","arxiv_id":"2007.04178","repositories_listed":2,"syntology":null},{"url":"/paper/robust-pricing-and-hedging-via-neural-sdes","slug":"robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","arxiv_id":"2007.04154","repositories_listed":2,"syntology":{"n":24,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":1,"n_no_contract":14,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 1 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/robust-pricing-and-hedging-via-neural-sdes#ran","syntology_url":"https://syntology.ai/paper/2007.04154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04154"}},"official":{"repos":["msabvid/robust_nsde"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/revisiting-the-train-loss-an-efficient","slug":"revisiting-the-train-loss-an-efficient","title":"Speedy Performance Estimation for Neural Architecture Search","date":"2020-06-08","arxiv_id":"2006.04492","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-the-train-loss-an-efficient#ran","syntology_url":"https://syntology.ai/paper/2006.04492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04492"}},"official":{"repos":["rubinxin/TSE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-weakly-supervised-object","slug":"evaluating-weakly-supervised-object","title":"Evaluating Weakly Supervised Object Localization Methods Right","date":"2020-01-21","arxiv_id":"2001.07437","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-weakly-supervised-object#ran","syntology_url":"https://syntology.ai/paper/2001.07437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.07437"}},"official":{"repos":["clovaai/wsolevaluation"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/diagnostic-curves-for-black-box-models","slug":"diagnostic-curves-for-black-box-models","title":"Automated Dependence Plots","date":"2019-12-02","arxiv_id":"1912.01108","repositories_listed":2,"syntology":null},{"url":"/paper/one-network-to-segment-them-all-a-general","slug":"one-network-to-segment-them-all-a-general","title":"One Network to Segment Them All: A General, Lightweight System for Accurate 3D Medical Image Segmentation","date":"2019-11-05","arxiv_id":"1911.01764","repositories_listed":2,"syntology":null},{"url":"/paper/epp-interpretable-score-of-model-predictive","slug":"epp-interpretable-score-of-model-predictive","title":"EPP: interpretable score of model predictive power","date":"2019-08-24","arxiv_id":"1908.09213","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-deep-subspace-clustering-networks","slug":"multi-view-deep-subspace-clustering-networks","title":"Multi-view Deep Subspace Clustering Networks","date":"2019-08-06","arxiv_id":"1908.01978","repositories_listed":2,"syntology":null},{"url":"/paper/190600442","slug":"190600442","title":"An Evaluation Toolkit to Guide Model Selection and Cohort Definition in Causal Inference","date":"2019-06-02","arxiv_id":"1906.00442","repositories_listed":2,"syntology":null},{"url":"/paper/towards-accurate-model-selection-in-deep","slug":"towards-accurate-model-selection-in-deep","title":"Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation","date":"2019-06-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-generalized-method-of-moments-for","slug":"deep-generalized-method-of-moments-for","title":"Deep Generalized Method of Moments for Instrumental Variable Analysis","date":"2019-05-29","arxiv_id":"1905.12495","repositories_listed":2,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-2","slug":"convolutional-neural-networks-for-2","title":"Convolutional Neural Networks for Classification of Alzheimer's Disease: Overview and Reproducible Evaluation","date":"2019-04-16","arxiv_id":"1904.07773","repositories_listed":2,"syntology":null},{"url":"/paper/deep-bayesian-multi-target-learning-for","slug":"deep-bayesian-multi-target-learning-for","title":"Deep Bayesian Multi-Target Learning for Recommender Systems","date":"2019-02-25","arxiv_id":"1902.09154","repositories_listed":2,"syntology":null},{"url":"/paper/odin-ode-informed-regression-for-parameter","slug":"odin-ode-informed-regression-for-parameter","title":"ODIN: ODE-Informed Regression for Parameter and State Inference in Time-Continuous Dynamical Systems","date":"2019-02-17","arxiv_id":"1902.06278","repositories_listed":2,"syntology":null},{"url":"/paper/separating-common-global-and-local-and","slug":"separating-common-global-and-local-and","title":"Separating common (global and local) and distinct variation in multiple mixed types data sets","date":"2019-02-17","arxiv_id":"1902.06241","repositories_listed":2,"syntology":null},{"url":"/paper/comprehensive-evaluation-of-deep-learning","slug":"comprehensive-evaluation-of-deep-learning","title":"Comprehensive Evaluation of Deep Learning Architectures for Prediction of DNA/RNA Sequence Binding Specificities","date":"2019-01-29","arxiv_id":"1901.10526","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/comprehensive-evaluation-of-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1901.10526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10526"}},"official":{"repos":["MedChaabane/deepRAM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-subseasonal-forecasting-in-the","slug":"improving-subseasonal-forecasting-in-the","title":"Improving Subseasonal Forecasting in the Western U.S. with Machine Learning","date":"2018-09-19","arxiv_id":"1809.07394","repositories_listed":2,"syntology":null},{"url":"/paper/fast-model-selection-through-adapting-design","slug":"fast-model-selection-through-adapting-design","title":"Optimal design of experiments to identify latent behavioral types","date":"2018-07-10","arxiv_id":"1807.07024","repositories_listed":2,"syntology":null},{"url":"/paper/structured-variational-learning-of-bayesian","slug":"structured-variational-learning-of-bayesian","title":"Structured Variational Learning of Bayesian Neural Networks with Horseshoe Priors","date":"2018-06-13","arxiv_id":"1806.05975","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"10 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-variational-learning-of-bayesian#ran","syntology_url":"https://syntology.ai/paper/1806.05975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05975"}},"official":null}},{"url":"/paper/parsimonious-bayesian-deep-networks","slug":"parsimonious-bayesian-deep-networks","title":"Parsimonious Bayesian deep networks","date":"2018-05-22","arxiv_id":"1805.08719","repositories_listed":2,"syntology":null},{"url":"/paper/atm-a-distributed-collaborative-scalable","slug":"atm-a-distributed-collaborative-scalable","title":"ATM: A distributed, collaborative, scalable system for automated machine learning","date":"2017-12-11","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/the-merging-path-plot-adaptive-fusing-of-k","slug":"the-merging-path-plot-adaptive-fusing-of-k","title":"The Merging Path Plot: adaptive fusing of k-groups with likelihood-based model selection","date":"2017-09-13","arxiv_id":"1709.04412","repositories_listed":2,"syntology":null},{"url":"/paper/data-driven-advice-for-applying-machine","slug":"data-driven-advice-for-applying-machine","title":"Data-driven Advice for Applying Machine Learning to Bioinformatics Problems","date":"2017-08-08","arxiv_id":"1708.05070","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-dirichlet-process-mixtures-of","slug":"sequential-dirichlet-process-mixtures-of","title":"Sequential Dirichlet Process Mixtures of Multivariate Skew t-distributions for Model-based Clustering of Flow Cytometry Data","date":"2017-02-14","arxiv_id":"1702.04407","repositories_listed":2,"syntology":null},{"url":"/paper/precision-recall-gain-curves-pr-analysis-done","slug":"precision-recall-gain-curves-pr-analysis-done","title":"Precision-Recall-Gain Curves: PR Analysis Done Right","date":"2015-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-concentration-of-regression-trees","slug":"adaptive-concentration-of-regression-trees","title":"Adaptive Concentration of Regression Trees, with Application to Random Forests","date":"2015-03-22","arxiv_id":"1503.06388","repositories_listed":2,"syntology":null},{"url":"/paper/how-many-topics-stability-analysis-for-topic","slug":"how-many-topics-stability-analysis-for-topic","title":"How Many Topics? Stability Analysis for Topic Models","date":"2014-04-16","arxiv_id":"1404.4606","repositories_listed":2,"syntology":null},{"url":"/paper/hyperopt-a-python-library-for-optimizing-the","slug":"hyperopt-a-python-library-for-optimizing-the","title":"Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms","date":"2013-12-12","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/stability-approach-to-regularization-1","slug":"stability-approach-to-regularization-1","title":"Stability Approach to Regularization Selection (StARS) for High Dimensional Graphical Models","date":"2010-06-16","arxiv_id":"1006.3316","repositories_listed":2,"syntology":null},{"url":"/paper/bolasso-model-consistent-lasso-estimation","slug":"bolasso-model-consistent-lasso-estimation","title":"Bolasso: model consistent Lasso estimation through the bootstrap","date":"2008-04-08","arxiv_id":"0804.1302","repositories_listed":2,"syntology":null},{"url":"/paper/mtsbench-benchmarking-multivariate-time","slug":"mtsbench-benchmarking-multivariate-time","title":"mTSBench: Benchmarking Multivariate Time Series Anomaly Detection and Model Selection at Scale","date":"2025-06-26","arxiv_id":"2506.21550","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-predictive-equivalence-in-decision","slug":"leveraging-predictive-equivalence-in-decision","title":"Leveraging Predictive Equivalence in Decision Trees","date":"2025-06-17","arxiv_id":"2506.14143","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/leveraging-predictive-equivalence-in-decision#ran","syntology_url":"https://syntology.ai/paper/2506.14143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14143"}},"official":{"repos":["haydenmct/predictive-equivalence"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-use-of-cross-validation-in-the-analysis","slug":"the-use-of-cross-validation-in-the-analysis","title":"The use of cross validation in the analysis of designed experiments","date":"2025-06-17","arxiv_id":"2506.14593","repositories_listed":1,"syntology":null},{"url":"/paper/router-r1-teaching-llms-multi-round-routing","slug":"router-r1-teaching-llms-multi-round-routing","title":"Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learning","date":"2025-06-10","arxiv_id":"2506.09033","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":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) · 0 unverified","sample_list":"/paper/router-r1-teaching-llms-multi-round-routing#ran","syntology_url":"https://syntology.ai/paper/2506.09033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.09033"}},"official":{"repos":["ulab-uiuc/router-r1"],"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/tuning-the-right-foundation-models-is-what","slug":"tuning-the-right-foundation-models-is-what","title":"Tuning the Right Foundation Models is What you Need for Partial Label Learning","date":"2025-06-05","arxiv_id":"2506.05027","repositories_listed":1,"syntology":null},{"url":"/paper/behavioral-augmentation-of-uml-class-diagrams","slug":"behavioral-augmentation-of-uml-class-diagrams","title":"Behavioral Augmentation of UML Class Diagrams: An Empirical Study of Large Language Models for Method Generation","date":"2025-06-01","arxiv_id":"2506.00788","repositories_listed":1,"syntology":null},{"url":"/paper/desocial-blockchain-based-decentralized","slug":"desocial-blockchain-based-decentralized","title":"DeSocial: Blockchain-based Decentralized Social Networks","date":"2025-05-27","arxiv_id":"2505.21388","repositories_listed":1,"syntology":null},{"url":"/paper/pared-model-selection-using-multi-objective","slug":"pared-model-selection-using-multi-objective","title":"pared: Model selection using multi-objective optimization","date":"2025-05-27","arxiv_id":"2505.21730","repositories_listed":1,"syntology":null},{"url":"/paper/optimindtune-a-multi-agent-framework-for","slug":"optimindtune-a-multi-agent-framework-for","title":"OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization","date":"2025-05-25","arxiv_id":"2505.19205","repositories_listed":1,"syntology":null},{"url":"/paper/lasso-ode-a-framework-for-mechanistic-model","slug":"lasso-ode-a-framework-for-mechanistic-model","title":"LASSO-ODE: A framework for mechanistic model identifiability and selection in disease transmission modeling","date":"2025-05-22","arxiv_id":"2505.17252","repositories_listed":1,"syntology":null}],"syntology_records":34,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":141,"papers_where_code_ran_first_page":"/task/model-selection/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":21,"url":"/task/model-selection/papers/2","json":"/task/model-selection/papers/2.json","rows":100},{"order":"archive","page":3,"of":21,"url":"/task/model-selection/papers/3","json":"/task/model-selection/papers/3.json","rows":100},{"order":"archive","page":4,"of":21,"url":"/task/model-selection/papers/4","json":"/task/model-selection/papers/4.json","rows":100},{"order":"archive","page":5,"of":21,"url":"/task/model-selection/papers/5","json":"/task/model-selection/papers/5.json","rows":100},{"order":"archive","page":6,"of":21,"url":"/task/model-selection/papers/6","json":"/task/model-selection/papers/6.json","rows":100},{"order":"archive","page":7,"of":21,"url":"/task/model-selection/papers/7","json":"/task/model-selection/papers/7.json","rows":100},{"order":"archive","page":8,"of":21,"url":"/task/model-selection/papers/8","json":"/task/model-selection/papers/8.json","rows":100},{"order":"archive","page":9,"of":21,"url":"/task/model-selection/papers/9","json":"/task/model-selection/papers/9.json","rows":100},{"order":"archive","page":10,"of":21,"url":"/task/model-selection/papers/10","json":"/task/model-selection/papers/10.json","rows":100},{"order":"archive","page":11,"of":21,"url":"/task/model-selection/papers/11","json":"/task/model-selection/papers/11.json","rows":100},{"order":"archive","page":12,"of":21,"url":"/task/model-selection/papers/12","json":"/task/model-selection/papers/12.json","rows":100},{"order":"archive","page":13,"of":21,"url":"/task/model-selection/papers/13","json":"/task/model-selection/papers/13.json","rows":100},{"order":"archive","page":14,"of":21,"url":"/task/model-selection/papers/14","json":"/task/model-selection/papers/14.json","rows":100},{"order":"archive","page":15,"of":21,"url":"/task/model-selection/papers/15","json":"/task/model-selection/papers/15.json","rows":100},{"order":"archive","page":16,"of":21,"url":"/task/model-selection/papers/16","json":"/task/model-selection/papers/16.json","rows":100},{"order":"archive","page":17,"of":21,"url":"/task/model-selection/papers/17","json":"/task/model-selection/papers/17.json","rows":100},{"order":"archive","page":18,"of":21,"url":"/task/model-selection/papers/18","json":"/task/model-selection/papers/18.json","rows":100},{"order":"archive","page":19,"of":21,"url":"/task/model-selection/papers/19","json":"/task/model-selection/papers/19.json","rows":100},{"order":"archive","page":20,"of":21,"url":"/task/model-selection/papers/20","json":"/task/model-selection/papers/20.json","rows":100},{"order":"archive","page":21,"of":21,"url":"/task/model-selection/papers/21","json":"/task/model-selection/papers/21.json","rows":50},{"order":"ran","page":1,"of":2,"url":"/task/model-selection/papers/ran/1","json":"/task/model-selection/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/model-selection/papers/ran/2","json":"/task/model-selection/papers/ran/2.json","rows":41}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5ec2d3b5be92dc9cf29c4050de1c6265425f9940f87e57840bb92b24c2d9df73","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}