{"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/papers/7","list_of":"/task/model-selection","task":"Model Selection","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":7,"pages_in_order":21,"rows_per_page":100,"rows":[601,700],"of":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":115,"every_run_a_failure_of_syntologys_instrument":26,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":26,"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-selection","prev":"/task/model-selection/papers/6","next":"/task/model-selection/papers/8","papers":[{"url":"/paper/learning-equations-for-extrapolation-and","slug":"learning-equations-for-extrapolation-and","title":"Learning Equations for Extrapolation and Control","date":"2018-06-19","arxiv_id":"1806.07259","repositories_listed":1,"syntology":null},{"url":"/paper/using-j-k-fold-cross-validation-to-reduce","slug":"using-j-k-fold-cross-validation-to-reduce","title":"Using J-K fold Cross Validation to Reduce Variance When Tuning NLP Models","date":"2018-06-19","arxiv_id":"1806.07139","repositories_listed":1,"syntology":null},{"url":"/paper/robust-bayesian-model-selection-for-variable","slug":"robust-bayesian-model-selection-for-variable","title":"Robust Bayesian Model Selection for Variable Clustering with the Gaussian Graphical Model","date":"2018-06-15","arxiv_id":"1806.05924","repositories_listed":1,"syntology":null},{"url":"/paper/degrees-of-freedom-and-model-selection-for","slug":"degrees-of-freedom-and-model-selection-for","title":"Degrees of Freedom and Model Selection for k-means Clustering","date":"2018-06-06","arxiv_id":"1806.02034","repositories_listed":1,"syntology":null},{"url":"/paper/topological-data-analysis-of-decision","slug":"topological-data-analysis-of-decision","title":"Topological Data Analysis of Decision Boundaries with Application to Model Selection","date":"2018-05-25","arxiv_id":"1805.09949","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topological-data-analysis-of-decision#ran","syntology_url":"https://syntology.ai/paper/1805.09949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09949"}},"official":{"repos":["nrkarthikeyan/topology-decision-boundaries"],"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/bayesian-joint-spike-and-slab-graphical-lasso","slug":"bayesian-joint-spike-and-slab-graphical-lasso","title":"Bayesian Joint Spike-and-Slab Graphical Lasso","date":"2018-05-18","arxiv_id":"1805.07051","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-with-lasso-zero-adding-straw","slug":"model-selection-with-lasso-zero-adding-straw","title":"Model selection with lasso-zero: adding straw to the haystack to better find needles","date":"2018-05-14","arxiv_id":"1805.05133","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-bayesian-on-line-changepoint","slug":"spatio-temporal-bayesian-on-line-changepoint","title":"Spatio-temporal Bayesian On-line Changepoint Detection with Model Selection","date":"2018-05-14","arxiv_id":"1805.05383","repositories_listed":1,"syntology":null},{"url":"/paper/tensormachine-probabilistic-boolean-tensor","slug":"tensormachine-probabilistic-boolean-tensor","title":"TensOrMachine: Probabilistic Boolean Tensor Decomposition","date":"2018-05-11","arxiv_id":"1805.04582","repositories_listed":1,"syntology":null},{"url":"/paper/180410877","slug":"180410877","title":"Entity Set Search of Scientific Literature: An Unsupervised Ranking Approach","date":"2018-04-29","arxiv_id":"1804.10877","repositories_listed":1,"syntology":null},{"url":"/paper/effects-of-sampling-skewness-of-the","slug":"effects-of-sampling-skewness-of-the","title":"Effects of sampling skewness of the importance-weighted risk estimator on model selection","date":"2018-04-19","arxiv_id":"1804.07344","repositories_listed":1,"syntology":null},{"url":"/paper/multi-locus-data-distinguishes-between","slug":"multi-locus-data-distinguishes-between","title":"Multi-locus data distinguishes between population growth and multiple merger coalescents","date":"2018-04-19","arxiv_id":"1701.07787","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-and-parameter-inference-in","slug":"model-selection-and-parameter-inference-in","title":"Model selection and parameter inference in phylogenetics using Nested Sampling","date":"2018-04-10","arxiv_id":"1703.05471","repositories_listed":1,"syntology":null},{"url":"/paper/neural-architecture-search-with-bayesian","slug":"neural-architecture-search-with-bayesian","title":"Neural Architecture Search with Bayesian Optimisation and Optimal Transport","date":"2018-02-11","arxiv_id":"1802.07191","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/neural-architecture-search-with-bayesian#ran","syntology_url":"https://syntology.ai/paper/1802.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07191"}},"official":{"repos":["kirthevasank/nasbot"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/natural-language-inference-over-interaction","slug":"natural-language-inference-over-interaction","title":"Natural Language Inference over Interaction Space: ICLR 2018 Reproducibility Report","date":"2018-02-09","arxiv_id":"1802.03198","repositories_listed":1,"syntology":null},{"url":"/paper/deeper-insights-into-graph-convolutional","slug":"deeper-insights-into-graph-convolutional","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","date":"2018-01-22","arxiv_id":"1801.07606","repositories_listed":1,"syntology":null},{"url":"/paper/context-tree-selection-for-functional-data","slug":"context-tree-selection-for-functional-data","title":"Context tree selection for functional data","date":"2018-01-11","arxiv_id":"1602.00579","repositories_listed":1,"syntology":null},{"url":"/paper/the-information-bottleneck-and-geometric","slug":"the-information-bottleneck-and-geometric","title":"The information bottleneck and geometric clustering","date":"2017-12-27","arxiv_id":"1712.09657","repositories_listed":1,"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":3,"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/the-information-bottleneck-and-geometric#ran","syntology_url":"https://syntology.ai/paper/1712.09657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09657"}},"official":{"repos":["djstrouse/information-bottleneck"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/arbitrage-free-regularization","slug":"arbitrage-free-regularization","title":"Deep Learning in a Generalized HJM-type Framework Through Arbitrage-Free Regularization","date":"2017-10-14","arxiv_id":"1710.05114","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-multi-penalty-regularization-based","slug":"adaptive-multi-penalty-regularization-based","title":"Adaptive multi-penalty regularization based on a generalized Lasso path","date":"2017-10-11","arxiv_id":"1710.03971","repositories_listed":1,"syntology":null},{"url":"/paper/dagger-a-sequential-algorithm-for-fdr-control","slug":"dagger-a-sequential-algorithm-for-fdr-control","title":"DAGGER: A sequential algorithm for FDR control on DAGs","date":"2017-09-29","arxiv_id":"1709.10250","repositories_listed":1,"syntology":null},{"url":"/paper/evasion-attacks-against-machine-learning-at","slug":"evasion-attacks-against-machine-learning-at","title":"Evasion Attacks against Machine Learning at Test Time","date":"2017-08-21","arxiv_id":"1708.06131","repositories_listed":1,"syntology":null},{"url":"/paper/a-network-approach-to-topic-models","slug":"a-network-approach-to-topic-models","title":"A network approach to topic models","date":"2017-08-04","arxiv_id":"1708.01677","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-weighted-stochastic-block","slug":"nonparametric-weighted-stochastic-block","title":"Nonparametric weighted stochastic block models","date":"2017-08-04","arxiv_id":"1708.01432","repositories_listed":1,"syntology":null},{"url":"/paper/udl-at-semeval-2017-task-1-semantic-textual","slug":"udl-at-semeval-2017-task-1-semantic-textual","title":"UdL at SemEval-2017 Task 1: Semantic Textual Similarity Estimation of English Sentence Pairs Using Regression Model over Pairwise Features","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/familia-an-open-source-toolkit-for-industrial","slug":"familia-an-open-source-toolkit-for-industrial","title":"Familia: An Open-Source Toolkit for Industrial Topic Modeling","date":"2017-07-31","arxiv_id":"1707.09823","repositories_listed":1,"syntology":null},{"url":"/paper/graphical-posterior-predictive-classifier","slug":"graphical-posterior-predictive-classifier","title":"Graphical posterior predictive classifier: Bayesian model averaging with particle Gibbs","date":"2017-07-21","arxiv_id":"1707.06792","repositories_listed":1,"syntology":null},{"url":"/paper/comparative-study-of-inference-methods-for","slug":"comparative-study-of-inference-methods-for","title":"Comparative Study of Inference Methods for Bayesian Nonnegative Matrix Factorisation","date":"2017-07-13","arxiv_id":"1707.05147","repositories_listed":1,"syntology":null},{"url":"/paper/charda-causal-hybrid-automata-recovery-via","slug":"charda-causal-hybrid-automata-recovery-via","title":"CHARDA: Causal Hybrid Automata Recovery via Dynamic Analysis","date":"2017-07-11","arxiv_id":"1707.03336","repositories_listed":1,"syntology":null},{"url":"/paper/improving-session-recommendation-with","slug":"improving-session-recommendation-with","title":"Improving Session Recommendation with Recurrent Neural Networks by Exploiting Dwell Time","date":"2017-06-30","arxiv_id":"1706.10231","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-classification-by-sparse","slug":"high-dimensional-classification-by-sparse","title":"High-dimensional classification by sparse logistic regression","date":"2017-06-26","arxiv_id":"1706.08344","repositories_listed":1,"syntology":null},{"url":"/paper/the-ratio-of-normalizing-constants-for","slug":"the-ratio-of-normalizing-constants-for","title":"Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models","date":"2017-06-14","arxiv_id":"1706.04416","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-stochastic-blockmodeling","slug":"bayesian-stochastic-blockmodeling","title":"Bayesian stochastic blockmodeling","date":"2017-05-29","arxiv_id":"1705.10225","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-in-bayesian-neural-networks","slug":"model-selection-in-bayesian-neural-networks","title":"Model Selection in Bayesian Neural Networks via Horseshoe Priors","date":"2017-05-29","arxiv_id":"1705.10388","repositories_listed":1,"syntology":null},{"url":"/paper/consistencies-and-inconsistencies-between","slug":"consistencies-and-inconsistencies-between","title":"Consistencies and inconsistencies between model selection and link prediction in networks","date":"2017-05-22","arxiv_id":"1705.07967","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-matrix-factorization-for","slug":"probabilistic-matrix-factorization-for","title":"Probabilistic Matrix Factorization for Automated Machine Learning","date":"2017-05-15","arxiv_id":"1705.05355","repositories_listed":1,"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/probabilistic-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/1705.05355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.05355"}},"official":{"repos":["rsheth80/pmf-automl"],"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/efficient-feature-screening-for-lasso-type","slug":"efficient-feature-screening-for-lasso-type","title":"Hybrid safe-strong rules for efficient optimization in lasso-type problems","date":"2017-04-27","arxiv_id":"1704.08742","repositories_listed":1,"syntology":null},{"url":"/paper/cross-validation-with-confidence","slug":"cross-validation-with-confidence","title":"Cross-Validation with Confidence","date":"2017-03-23","arxiv_id":"1703.07904","repositories_listed":1,"syntology":null},{"url":"/paper/metboost-exploratory-regression-analysis-with","slug":"metboost-exploratory-regression-analysis-with","title":"metboost: Exploratory regression analysis with hierarchically clustered data","date":"2017-02-13","arxiv_id":"1702.03994","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-sample-complexity-of-graphical-model","slug":"on-the-sample-complexity-of-graphical-model","title":"On the Sample Complexity of Graphical Model Selection for Non-Stationary Processes","date":"2017-01-17","arxiv_id":"1701.04724","repositories_listed":1,"syntology":null},{"url":"/paper/the-shallow-end-empowering-shallower-deep","slug":"the-shallow-end-empowering-shallower-deep","title":"The Shallow End: Empowering Shallower Deep-Convolutional Networks through Auxiliary Outputs","date":"2016-11-06","arxiv_id":"1611.01773","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-bayesian-inference-of-the","slug":"nonparametric-bayesian-inference-of-the","title":"Nonparametric Bayesian inference of the microcanonical stochastic block model","date":"2016-10-09","arxiv_id":"1610.02703","repositories_listed":1,"syntology":null},{"url":"/paper/gtapprox-surrogate-modeling-for-industrial","slug":"gtapprox-surrogate-modeling-for-industrial","title":"GTApprox: surrogate modeling for industrial design","date":"2016-09-05","arxiv_id":"1609.01088","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-hard-thresholding-for-model","slug":"iterative-hard-thresholding-for-model","title":"Iterative Hard Thresholding for Model Selection in Genome-Wide Association Studies","date":"2016-08-04","arxiv_id":"1608.01398","repositories_listed":1,"syntology":null},{"url":"/paper/making-tree-ensembles-interpretable-a","slug":"making-tree-ensembles-interpretable-a","title":"Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach","date":"2016-06-29","arxiv_id":"1606.09066","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/making-tree-ensembles-interpretable-a#ran","syntology_url":"https://syntology.ai/paper/1606.09066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09066"}},"official":{"repos":["sato9hara/defragTrees"],"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/phase-transitions-and-a-model-order-selection","slug":"phase-transitions-and-a-model-order-selection","title":"Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering","date":"2016-04-11","arxiv_id":"1604.03159","repositories_listed":1,"syntology":null},{"url":"/paper/interpretability-of-multivariate-brain-maps","slug":"interpretability-of-multivariate-brain-maps","title":"Interpretability of Multivariate Brain Maps in Brain Decoding: Definition and Quantification","date":"2016-03-29","arxiv_id":"1603.08704","repositories_listed":1,"syntology":null},{"url":"/paper/sacrificing-information-for-the-greater-good","slug":"sacrificing-information-for-the-greater-good","title":"Sacrificing information for the greater good: how to select photometric bands for optimal accuracy","date":"2015-11-17","arxiv_id":"1511.05424","repositories_listed":1,"syntology":null},{"url":"/paper/a-test-of-relative-similarity-for-model","slug":"a-test-of-relative-similarity-for-model","title":"A Test of Relative Similarity For Model Selection in Generative Models","date":"2015-11-14","arxiv_id":"1511.04581","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/a-test-of-relative-similarity-for-model#ran","syntology_url":"https://syntology.ai/paper/1511.04581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.04581"}},"official":{"repos":["eugenium/MMD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rbfopt-an-open-source-library-for-black-box","slug":"rbfopt-an-open-source-library-for-black-box","title":"RBFOpt: an open-source library for black-box optimization with costly function evaluations","date":"2015-11-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/nytro-when-subsampling-meets-early-stopping","slug":"nytro-when-subsampling-meets-early-stopping","title":"NYTRO: When Subsampling Meets Early Stopping","date":"2015-10-19","arxiv_id":"1510.05684","repositories_listed":1,"syntology":null},{"url":"/paper/ga-parsimony-a-ga-svr-approach-with-feature","slug":"ga-parsimony-a-ga-svr-approach-with-feature","title":"GA-PARSIMONY: A GA-SVR approach with feature selection and parameter optimization to obtain parsimonious solutions for predicting temperature settings in a continuous annealing furnace","date":"2015-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-mixtures-of-factor-analyzers","slug":"adaptive-mixtures-of-factor-analyzers","title":"Adaptive Mixtures of Factor Analyzers","date":"2015-07-10","arxiv_id":"1507.02801","repositories_listed":1,"syntology":null},{"url":"/paper/indian-buffet-process-for-model-selection-in","slug":"indian-buffet-process-for-model-selection-in","title":"Indian Buffet process for model selection in convolved multiple-output Gaussian processes","date":"2015-03-22","arxiv_id":"1503.06432","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-partially-linear-additive-models","slug":"sparse-partially-linear-additive-models","title":"Sparse Partially Linear Additive Models","date":"2014-07-17","arxiv_id":"1407.4729","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-block-structures-and-high","slug":"hierarchical-block-structures-and-high","title":"Hierarchical Block Structures and High-resolution Model Selection in Large Networks","date":"2013-10-16","arxiv_id":"1310.4377","repositories_listed":1,"syntology":null},{"url":"/paper/empirical-evaluation-of-scoring-functions-for","slug":"empirical-evaluation-of-scoring-functions-for","title":"Empirical evaluation of scoring functions for Bayesian network model selection","date":"2012-09-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-cross-validation-via-sequential-testing","slug":"fast-cross-validation-via-sequential-testing","title":"Fast Cross-Validation via Sequential Testing","date":"2012-06-11","arxiv_id":"1206.2248","repositories_listed":1,"syntology":null},{"url":null,"slug":"topic-modeling-and-link-prediction-for","title":"Topic Modeling and Link-Prediction for Material Property Discovery","date":"2025-07-08","arxiv_id":"2507.06139","repositories_listed":0,"syntology":null},{"url":null,"slug":"advanced-financial-reasoning-at-scale-a","title":"Advanced Financial Reasoning at Scale: A Comprehensive Evaluation of Large Language Models on CFA Level III","date":"2025-06-29","arxiv_id":"2507.02954","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-generalization-and-representation","title":"Evaluating Generalization and Representation Stability in Small LMs via Prompting, Fine-Tuning and Out-of-Distribution Prompts","date":"2025-06-16","arxiv_id":"2506.17289","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-boosting-for-spatial-regression","title":"Gradient Boosting for Spatial Regression Models with Autoregressive Disturbances","date":"2025-06-16","arxiv_id":"2506.13682","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-history-philosophy","title":"Large Language Models for History, Philosophy, and Sociology of Science: Interpretive Uses, Methodological Challenges, and Critical Perspectives","date":"2025-06-13","arxiv_id":"2506.12242","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sample-complexity-of-parameter-free","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","date":"2025-06-12","arxiv_id":"2506.11336","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-the-number-of-components-in-panel","title":"Estimating the Number of Components in Panel Data Finite Mixture Regression Models with an Application to Production Function Heterogeneity","date":"2025-06-11","arxiv_id":"2506.09666","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-framework-for-model-selection","title":"A Statistical Framework for Model Selection in LSTM Networks","date":"2025-06-07","arxiv_id":"2506.06840","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-multi-llm-inference","title":"Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques","date":"2025-06-06","arxiv_id":"2506.06579","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-05120","title":"Nonlinear Causal Discovery for Grouped Data","date":"2025-06-05","arxiv_id":"2506.05120","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowd-sft-crowdsourcing-for-llm-alignment","title":"Crowd-SFT: Crowdsourcing for LLM Alignment","date":"2025-06-04","arxiv_id":"2506.04063","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-tuning-video-transformers-for-word-level","title":"Fine-Tuning Video Transformers for Word-Level Bangla Sign Language: A Comparative Analysis for Classification Tasks","date":"2025-06-04","arxiv_id":"2506.04367","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-automotive-code-large-language","title":"Generating Automotive Code: Large Language Models for Software Development and Verification in Safety-Critical Systems","date":"2025-06-04","arxiv_id":"2506.04038","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-reusability-in-recommender-systems","title":"Universal Reusability in Recommender Systems: The Case for Dataset- and Task-Independent Frameworks","date":"2025-06-03","arxiv_id":"2506.03391","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-of-balanced-signed-graphs-1","title":"Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming","date":"2025-06-02","arxiv_id":"2506.01826","repositories_listed":0,"syntology":null},{"url":null,"slug":"selecting-for-less-discriminatory-algorithms","title":"Selecting for Less Discriminatory Algorithms: A Relational Search Framework for Navigating Fairness-Accuracy Trade-offs in Practice","date":"2025-06-02","arxiv_id":"2506.01594","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-growth-at-risk","title":"Machine-learning Growth at Risk","date":"2025-05-31","arxiv_id":"2506.00572","repositories_listed":0,"syntology":null},{"url":"/paper/dynamically-learned-test-time-model-routing","slug":"dynamically-learned-test-time-model-routing","title":"Dynamically Learned Test-Time Model Routing in Language Model Zoos with Service Level Guarantees","date":"2025-05-26","arxiv_id":"2505.19947","repositories_listed":0,"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/dynamically-learned-test-time-model-routing#ran","syntology_url":"https://syntology.ai/paper/2505.19947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19947"}},"official":null}},{"url":null,"slug":"weighted-leave-one-out-cross-validation","title":"Weighted Leave-One-Out Cross Validation","date":"2025-05-26","arxiv_id":"2505.19737","repositories_listed":0,"syntology":null},{"url":null,"slug":"assistedds-benchmarking-how-external-domain","title":"AssistedDS: Benchmarking How External Domain Knowledge Assists LLMs in Automated Data Science","date":"2025-05-25","arxiv_id":"2506.13992","repositories_listed":0,"syntology":null},{"url":null,"slug":"promptwise-online-learning-for-cost-aware","title":"PromptWise: Online Learning for Cost-Aware Prompt Assignment in Generative Models","date":"2025-05-24","arxiv_id":"2505.18901","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-symbolic-language-in-student-texts-a","title":"Handling Symbolic Language in Student Texts: A Comparative Study of NLP Embedding Models","date":"2025-05-23","arxiv_id":"2505.17950","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-variable-models-via-jarzynski","title":"Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm","date":"2025-05-23","arxiv_id":"2505.18427","repositories_listed":0,"syntology":null},{"url":null,"slug":"navigating-pitfalls-evaluating-llms-in","title":"Navigating Pitfalls: Evaluating LLMs in Machine Learning Programming Education","date":"2025-05-23","arxiv_id":"2505.18220","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-more-transferable-adversarial-attack","title":"Towards more transferable adversarial attack in black-box manner","date":"2025-05-23","arxiv_id":"2505.18097","repositories_listed":0,"syntology":null},{"url":null,"slug":"in-domain-african-languages-translation-using","title":"In-Domain African Languages Translation Using LLMs and Multi-armed Bandits","date":"2025-05-21","arxiv_id":"2505.15069","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-weaks-win-single-strong-large","title":"Multiple Weaks Win Single Strong: Large Language Models Ensemble Weak Reinforcement Learning Agents into a Supreme One","date":"2025-05-21","arxiv_id":"2505.15306","repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-convergence-in-private","title":"Second-Order Convergence in Private Stochastic Non-Convex Optimization","date":"2025-05-21","arxiv_id":"2505.15647","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asymptotic-equation-linking-waic-and-wbic","title":"An Asymptotic Equation Linking WAIC and WBIC in Singular Models","date":"2025-05-20","arxiv_id":"2505.13902","repositories_listed":0,"syntology":null},{"url":null,"slug":"choosing-a-model-shaping-a-future-comparing","title":"Choosing a Model, Shaping a Future: Comparing LLM Perspectives on Sustainability and its Relationship with AI","date":"2025-05-20","arxiv_id":"2505.14435","repositories_listed":0,"syntology":null},{"url":null,"slug":"truth-or-twist-optimal-model-selection-for","title":"Truth or Twist? Optimal Model Selection for Reliable Label Flipping Evaluation in LLM-based Counterfactuals","date":"2025-05-20","arxiv_id":"2505.13972","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-selection-for-gaussian-gated-gaussian","title":"Model Selection for Gaussian-gated Gaussian Mixture of Experts Using Dendrograms of Mixing Measures","date":"2025-05-19","arxiv_id":"2505.13052","repositories_listed":0,"syntology":null},{"url":null,"slug":"peer-pressure-model-to-model-regularization","title":"PEER pressure: Model-to-Model Regularization for Single Source Domain Generalization","date":"2025-05-19","arxiv_id":"2505.12745","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-dynamic-covariance-models","title":"High-Dimensional Dynamic Covariance Models with Random Forests","date":"2025-05-18","arxiv_id":"2505.12444","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-potential-of-ssl-models-for","title":"Exploring the Potential of SSL Models for Sound Event Detection","date":"2025-05-17","arxiv_id":"2505.11889","repositories_listed":0,"syntology":null},{"url":null,"slug":"thompson-sampling-like-algorithms-for","title":"Thompson Sampling-like Algorithms for Stochastic Rising Bandits","date":"2025-05-17","arxiv_id":"2505.12092","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-shot-forecasting-mortality-rates-a","title":"Zero-Shot Forecasting Mortality Rates: A Global Study","date":"2025-05-17","arxiv_id":"2505.13521","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-10775","title":"A Systematic Analysis of Base Model Choice for Reward Modeling","date":"2025-05-16","arxiv_id":"2505.10775","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11390","title":"IISE PG&E Energy Analytics Challenge 2025: Hourly-Binned Regression Models Beat Transformers in Load Forecasting","date":"2025-05-16","arxiv_id":"2505.11390","repositories_listed":0,"syntology":null},{"url":null,"slug":"pcs-uq-uncertainty-quantification-via-the","title":"PCS-UQ: Uncertainty Quantification via the Predictability-Computability-Stability Framework","date":"2025-05-13","arxiv_id":"2505.08784","repositories_listed":0,"syntology":null},{"url":null,"slug":"reassessing-large-language-model-boolean","title":"Reassessing Large Language Model Boolean Query Generation for Systematic Reviews","date":"2025-05-12","arxiv_id":"2505.07155","repositories_listed":0,"syntology":null},{"url":null,"slug":"tuning-for-trustworthiness-balancing","title":"Tuning for Trustworthiness -- Balancing Performance and Explanation Consistency in Neural Network Optimization","date":"2025-05-12","arxiv_id":"2505.07910","repositories_listed":0,"syntology":null}],"record_sha256":"058366d06101e391541194e5a7e21bcf4350ddc3e23f3725fa2358657c6a8e58","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}