{"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/6","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":6,"pages_in_order":21,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/model-selection/papers/7","papers":[{"url":"/paper/simulating-normalised-constants-with","slug":"simulating-normalised-constants-with","title":"Referenced Thermodynamic Integration for Bayesian Model Selection: Application to COVID-19 Model Selection","date":"2020-09-08","arxiv_id":"2009.03851","repositories_listed":1,"syntology":null},{"url":"/paper/minimum-discrepancy-principle-strategy-for","slug":"minimum-discrepancy-principle-strategy-for","title":"Minimum discrepancy principle strategy for choosing $k$ in $k$-NN regression","date":"2020-08-20","arxiv_id":"2008.08718","repositories_listed":1,"syntology":null},{"url":"/paper/an-information-criterion-for-automatic","slug":"an-information-criterion-for-automatic","title":"An information criterion for automatic gradient tree boosting","date":"2020-08-13","arxiv_id":"2008.05926","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-for-dynamic-resource","slug":"machine-learning-for-dynamic-resource","title":"Machine Learning for Dynamic Resource Allocation in Network Function Virtualization","date":"2020-08-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/batch-value-function-approximation-with-only","slug":"batch-value-function-approximation-with-only","title":"Batch Value-function Approximation with Only Realizability","date":"2020-08-11","arxiv_id":"2008.04990","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/batch-value-function-approximation-with-only#ran","syntology_url":"https://syntology.ai/paper/2008.04990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.04990"}},"official":null}},{"url":"/paper/individualized-prediction-of-covid-19-adverse","slug":"individualized-prediction-of-covid-19-adverse","title":"Individualized Prediction of COVID-19 Adverse outcomes with MLHO","date":"2020-08-10","arxiv_id":"2008.03869","repositories_listed":1,"syntology":null},{"url":"/paper/regression-modelling-with-i-priors","slug":"regression-modelling-with-i-priors","title":"Additive interaction modelling using I-priors","date":"2020-07-30","arxiv_id":"2007.15766","repositories_listed":1,"syntology":null},{"url":"/paper/tighter-risk-certificates-for-neural-networks","slug":"tighter-risk-certificates-for-neural-networks","title":"Tighter risk certificates for neural networks","date":"2020-07-25","arxiv_id":"2007.12911","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tighter-risk-certificates-for-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.12911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12911"}},"official":{"repos":["mperezortiz/PBB"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepnnk-explaining-deep-models-and-their","slug":"deepnnk-explaining-deep-models-and-their","title":"DeepNNK: Explaining deep models and their generalization using polytope interpolation","date":"2020-07-20","arxiv_id":"2007.10505","repositories_listed":1,"syntology":null},{"url":"/paper/extended-stochastic-block-models","slug":"extended-stochastic-block-models","title":"Extended Stochastic Block Models with Application to Criminal Networks","date":"2020-07-16","arxiv_id":"2007.08569","repositories_listed":1,"syntology":null},{"url":"/paper/an-asymptotically-optimal-multi-armed-bandit","slug":"an-asymptotically-optimal-multi-armed-bandit","title":"An Asymptotically Optimal Multi-Armed Bandit Algorithm and Hyperparameter Optimization","date":"2020-07-11","arxiv_id":"2007.05670","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-clustering-using-automatic","slug":"model-based-clustering-using-automatic","title":"Model-based Clustering using Automatic Differentiation: Confronting Misspecification and High-Dimensional Data","date":"2020-07-08","arxiv_id":"2007.12786","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-generalization-under-distribution","slug":"estimating-generalization-under-distribution","title":"Estimating Generalization under Distribution Shifts via Domain-Invariant Representations","date":"2020-07-06","arxiv_id":"2007.03511","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/estimating-generalization-under-distribution#ran","syntology_url":"https://syntology.ai/paper/2007.03511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03511"}},"official":{"repos":["chingyaoc/estimating-generalization"],"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/ana-at-semeval-2020-task-4-multi-task","slug":"ana-at-semeval-2020-task-4-multi-task","title":"ANA at SemEval-2020 Task 4: mUlti-task learNIng for cOmmonsense reasoNing (UNION)","date":"2020-06-29","arxiv_id":"2006.16403","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-inference-of-assortative","slug":"statistical-inference-of-assortative","title":"Statistical inference of assortative community structures","date":"2020-06-25","arxiv_id":"2006.14493","repositories_listed":1,"syntology":null},{"url":"/paper/offline-detection-of-change-points-in-the","slug":"offline-detection-of-change-points-in-the","title":"Offline detection of change-points in the mean for stationary graph signals","date":"2020-06-18","arxiv_id":"2006.10628","repositories_listed":1,"syntology":null},{"url":"/paper/assumption-lean-inference-for-generalised","slug":"assumption-lean-inference-for-generalised","title":"Assumption-lean inference for generalised linear model parameters","date":"2020-06-15","arxiv_id":"2006.08402","repositories_listed":1,"syntology":null},{"url":"/paper/selecting-the-number-of-clusters-k-with-a","slug":"selecting-the-number-of-clusters-k-with-a","title":"Selecting the Number of Clusters $K$ with a Stability Trade-off: an Internal Validation Criterion","date":"2020-06-15","arxiv_id":"2006.08530","repositories_listed":1,"syntology":null},{"url":"/paper/tensorflow-with-user-friendly-graphical","slug":"tensorflow-with-user-friendly-graphical","title":"TensorFlow with user friendly Graphical Framework for object detection API","date":"2020-06-11","arxiv_id":"2006.06385","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-c-means-clustering-for-persistence","slug":"fuzzy-c-means-clustering-for-persistence","title":"Fuzzy c-Means Clustering for Persistence Diagrams","date":"2020-06-04","arxiv_id":"2006.02796","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuzzy-c-means-clustering-for-persistence#ran","syntology_url":"https://syntology.ai/paper/2006.02796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02796"}},"official":{"repos":["tomogwen/fpdcluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-opinion-dynamics-from-social-traces","slug":"learning-opinion-dynamics-from-social-traces","title":"Learning Opinion Dynamics From Social Traces","date":"2020-06-02","arxiv_id":"2006.01673","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discretization-by-two","slug":"unsupervised-discretization-by-two","title":"Unsupervised Discretization by Two-dimensional MDL-based Histogram","date":"2020-06-02","arxiv_id":"2006.01893","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-based-camera-model-selection","slug":"uncertainty-based-camera-model-selection","title":"Uncertainty Based Camera Model Selection","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solution-path-algorithm-for-twin-multi-class","slug":"solution-path-algorithm-for-twin-multi-class","title":"Solution Path Algorithm for Twin Multi-class Support Vector Machine","date":"2020-05-30","arxiv_id":"2006.00276","repositories_listed":1,"syntology":null},{"url":"/paper/revealing-consensus-and-dissensus-between","slug":"revealing-consensus-and-dissensus-between","title":"Revealing consensus and dissensus between network partitions","date":"2020-05-28","arxiv_id":"2005.13977","repositories_listed":1,"syntology":null},{"url":"/paper/learning-equations-from-biological-data-with","slug":"learning-equations-from-biological-data-with","title":"Learning Equations from Biological Data with Limited Time Samples","date":"2020-05-19","arxiv_id":"2005.09622","repositories_listed":1,"syntology":null},{"url":"/paper/robust-lasso-zero-for-sparse-corruption-and","slug":"robust-lasso-zero-for-sparse-corruption-and","title":"Robust Lasso-Zero for sparse corruption and model selection with missing covariates","date":"2020-05-12","arxiv_id":"2005.05628","repositories_listed":1,"syntology":null},{"url":"/paper/the-scalable-birth-death-mcmc-algorithm-for","slug":"the-scalable-birth-death-mcmc-algorithm-for","title":"The scalable Birth-Death MCMC Algorithm for Mixed Graphical Model Learning with Application to Genomic Data Integration","date":"2020-05-08","arxiv_id":"2005.04139","repositories_listed":1,"syntology":null},{"url":"/paper/a-concise-yet-effective-model-for-non-aligned","slug":"a-concise-yet-effective-model-for-non-aligned","title":"A Concise yet Effective model for Non-Aligned Incomplete Multi-view and Missing Multi-label Learning","date":"2020-05-03","arxiv_id":"2005.00976","repositories_listed":1,"syntology":null},{"url":"/paper/bayesopt-adversarial-attack","slug":"bayesopt-adversarial-attack","title":"BayesOpt Adversarial Attack","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/driveml-an-r-package-for-driverless-machine","slug":"driveml-an-r-package-for-driverless-machine","title":"DriveML: An R Package for Driverless Machine Learning","date":"2020-05-01","arxiv_id":"2005.00478","repositories_listed":1,"syntology":null},{"url":"/paper/the-curse-of-performance-instability-in","slug":"the-curse-of-performance-instability-in","title":"The Curse of Performance Instability in Analysis Datasets: Consequences, Source, and Suggestions","date":"2020-04-28","arxiv_id":"2004.13606","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-curse-of-performance-instability-in#ran","syntology_url":"https://syntology.ai/paper/2004.13606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13606"}},"official":{"repos":["owenzx/InstabilityAnalysis"],"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/optimization-approaches-for-counterfactual","slug":"optimization-approaches-for-counterfactual","title":"Counterfactual Learning of Stochastic Policies with Continuous Actions: from Models to Offline Evaluation","date":"2020-04-22","arxiv_id":"2004.11722","repositories_listed":1,"syntology":null},{"url":"/paper/inference-in-the-stochastic-block-model-with","slug":"inference-in-the-stochastic-block-model-with","title":"Reliable Time Prediction in the Markov Stochastic Block Model","date":"2020-04-09","arxiv_id":"2004.04402","repositories_listed":1,"syntology":null},{"url":"/paper/sindy-pi-a-robust-algorithm-for-parallel","slug":"sindy-pi-a-robust-algorithm-for-parallel","title":"SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamics","date":"2020-04-05","arxiv_id":"2004.02322","repositories_listed":1,"syntology":null},{"url":"/paper/introduction-to-rare-event-predictive","slug":"introduction-to-rare-event-predictive","title":"Introduction to Rare-Event Predictive Modeling for Inferential Statisticians -- A Hands-On Application in the Prediction of Breakthrough Patents","date":"2020-03-30","arxiv_id":"2003.13441","repositories_listed":1,"syntology":null},{"url":"/paper/arda-automatic-relational-data-augmentation","slug":"arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","date":"2020-03-21","arxiv_id":"2003.09758","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/arda-automatic-relational-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2003.09758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09758"}},"official":null}},{"url":"/paper/depara-deep-attribution-graph-for-deep","slug":"depara-deep-attribution-graph-for-deep","title":"DEPARA: Deep Attribution Graph for Deep Knowledge Transferability","date":"2020-03-17","arxiv_id":"2003.07496","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/depara-deep-attribution-graph-for-deep#ran","syntology_url":"https://syntology.ai/paper/2003.07496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07496"}},"official":{"repos":["zju-vipa/DEPARA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-parameter-counting-in-deep-models","slug":"rethinking-parameter-counting-in-deep-models","title":"Rethinking Parameter Counting in Deep Models: Effective Dimensionality Revisited","date":"2020-03-04","arxiv_id":"2003.02139","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/rethinking-parameter-counting-in-deep-models#ran","syntology_url":"https://syntology.ai/paper/2003.02139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02139"}},"official":{"repos":["g-benton/hessian-eff-dim"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/approximate-cross-validation-guarantees-for","slug":"approximate-cross-validation-guarantees-for","title":"Approximate Cross-validation: Guarantees for Model Assessment and Selection","date":"2020-03-02","arxiv_id":"2003.00617","repositories_listed":1,"syntology":null},{"url":"/paper/impact-of-imagenet-model-selection-on-domain","slug":"impact-of-imagenet-model-selection-on-domain","title":"Impact of ImageNet Model Selection on Domain Adaptation","date":"2020-02-06","arxiv_id":"2002.02559","repositories_listed":1,"syntology":null},{"url":"/paper/libtwinsvm-a-library-for-twin-support-vector","slug":"libtwinsvm-a-library-for-twin-support-vector","title":"LIBTwinSVM: A Library for Twin Support Vector Machines","date":"2020-01-27","arxiv_id":"2001.10073","repositories_listed":1,"syntology":null},{"url":"/paper/the-reciprocal-bayesian-lasso","slug":"the-reciprocal-bayesian-lasso","title":"The Reciprocal Bayesian LASSO","date":"2020-01-23","arxiv_id":"2001.08327","repositories_listed":1,"syntology":null},{"url":"/paper/stepwise-model-selection-for-sequence","slug":"stepwise-model-selection-for-sequence","title":"Stepwise Model Selection for Sequence Prediction via Deep Kernel Learning","date":"2020-01-12","arxiv_id":"2001.03898","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-convolutional-neural-networks","slug":"inferring-convolutional-neural-networks","title":"Inferring Convolutional Neural Networks' accuracies from their architectural characterizations","date":"2020-01-07","arxiv_id":"2001.02160","repositories_listed":1,"syntology":null},{"url":"/paper/source-model-selection-for-deep-learning-in","slug":"source-model-selection-for-deep-learning-in","title":"Source Model Selection for Deep Learning in the Time Series Domain","date":"2020-01-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/infogan-cr-disentangling-generative-1","slug":"infogan-cr-disentangling-generative-1","title":"InfoGAN-CR: Disentangling Generative Adversarial Networks with Contrastive Regularizers","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-adaptive-simulated-annealing-em-algorithm","slug":"an-adaptive-simulated-annealing-em-algorithm","title":"An adaptive simulated annealing EM algorithm for inference on non-homogeneous hidden Markov models","date":"2019-12-20","arxiv_id":"1912.09733","repositories_listed":1,"syntology":null},{"url":"/paper/a-normative-theory-for-causal-inference-and","slug":"a-normative-theory-for-causal-inference-and","title":"A Normative Theory for Causal Inference and Bayes Factor Computation in Neural Circuits","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multiclass-learning-from-contradictions","slug":"multiclass-learning-from-contradictions","title":"Multiclass Learning from Contradictions","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalised-linear-models-for-dependent","slug":"generalised-linear-models-for-dependent","title":"Generalised Linear Models for Dependent Binary Outcomes with Applications to Household Stratified Pandemic Influenza Data","date":"2019-11-27","arxiv_id":"1911.12115","repositories_listed":1,"syntology":null},{"url":"/paper/factored-latent-dynamic-conditional-random","slug":"factored-latent-dynamic-conditional-random","title":"Factored Latent-Dynamic Conditional Random Fields for Single and Multi-label Sequence Modeling","date":"2019-11-09","arxiv_id":"1911.03667","repositories_listed":1,"syntology":null},{"url":"/paper/a-multiple-testing-framework-for-diagnostic","slug":"a-multiple-testing-framework-for-diagnostic","title":"A multiple testing framework for diagnostic accuracy studies with co-primary endpoints","date":"2019-11-08","arxiv_id":"1911.02982","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-coordination-strategies-from-time","slug":"inferring-coordination-strategies-from-time","title":"Framework for Inferring Following Strategies from Time Series of Movement Data","date":"2019-11-04","arxiv_id":"1911.01366","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-self-training-framework-for-graph","slug":"dynamic-self-training-framework-for-graph","title":"Effective Stabilized Self-Training on Few-Labeled Graph Data","date":"2019-10-07","arxiv_id":"1910.02684","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dynamic-self-training-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/1910.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02684"}},"official":null}},{"url":"/paper/exploiting-bert-for-end-to-end-aspect-based","slug":"exploiting-bert-for-end-to-end-aspect-based","title":"Exploiting BERT for End-to-End Aspect-based Sentiment Analysis","date":"2019-10-02","arxiv_id":"1910.00883","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-cross-validation-effective","slug":"counterfactual-cross-validation-effective","title":"Counterfactual Cross-Validation: Stable Model Selection Procedure for Causal Inference Models","date":"2019-09-11","arxiv_id":"1909.05299","repositories_listed":1,"syntology":null},{"url":"/paper/deep-weakly-supervised-learning-methods-for","slug":"deep-weakly-supervised-learning-methods-for","title":"Deep Weakly-Supervised Learning Methods for Classification and Localization in Histology Images: A Survey","date":"2019-09-08","arxiv_id":"1909.03354","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-weakly-supervised-learning-methods-for#ran","syntology_url":"https://syntology.ai/paper/1909.03354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03354"}},"official":{"repos":["jeromerony/survey_wsl_histology"],"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/quality-estimation-for-image-captions-based","slug":"quality-estimation-for-image-captions-based","title":"Quality Estimation for Image Captions Based on Large-scale Human Evaluations","date":"2019-09-08","arxiv_id":"1909.03396","repositories_listed":1,"syntology":null},{"url":"/paper/learning-neural-representations-for-network","slug":"learning-neural-representations-for-network","title":"Learning Neural Representations for Network Anomaly Detection","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-spline-fitting-with-particle-swarm","slug":"adaptive-spline-fitting-with-particle-swarm","title":"Adaptive spline fitting with particle swarm optimization","date":"2019-07-28","arxiv_id":"1907.12160","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-robust-off-policy-evaluation-with","slug":"doubly-robust-off-policy-evaluation-with","title":"Doubly robust off-policy evaluation with shrinkage","date":"2019-07-22","arxiv_id":"1907.09623","repositories_listed":1,"syntology":null},{"url":"/paper/stability-selection-enables-robust-learning","slug":"stability-selection-enables-robust-learning","title":"Stability selection enables robust learning of partial differential equations from limited noisy data","date":"2019-07-17","arxiv_id":"1907.07810","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stability-selection-enables-robust-learning#ran","syntology_url":"https://syntology.ai/paper/1907.07810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07810"}},"official":{"repos":["SuryanarayanaMK/PDE-STRIDE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sparsely-activated-networks","slug":"sparsely-activated-networks","title":"Sparsely Activated Networks","date":"2019-07-12","arxiv_id":"1907.06592","repositories_listed":1,"syntology":null},{"url":"/paper/change-point-detection-for-graphical-models","slug":"change-point-detection-for-graphical-models","title":"Change point detection for graphical models in the presence of missing values","date":"2019-07-11","arxiv_id":"1907.05409","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-evaluation-of-conditional-gans","slug":"on-the-evaluation-of-conditional-gans","title":"On the Evaluation of Conditional GANs","date":"2019-07-11","arxiv_id":"1907.08175","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-evaluation-of-conditional-gans#ran","syntology_url":"https://syntology.ai/paper/1907.08175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.08175"}},"official":{"repos":["facebookresearch/fjd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fiesta-fast-identification-of-state-of-the","slug":"fiesta-fast-identification-of-state-of-the","title":"FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms","date":"2019-06-28","arxiv_id":"1906.12230","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-testing-and-variable-selection-along","slug":"multiple-testing-and-variable-selection-along","title":"Multiple Testing and Variable Selection along the path of the Least Angle Regression","date":"2019-06-28","arxiv_id":"1906.12072","repositories_listed":1,"syntology":null},{"url":"/paper/deep-active-learning-with-adaptive","slug":"deep-active-learning-with-adaptive","title":"Deep Active Learning with Adaptive Acquisition","date":"2019-06-27","arxiv_id":"1906.11471","repositories_listed":1,"syntology":null},{"url":"/paper/infogan-cr-disentangling-generative","slug":"infogan-cr-disentangling-generative","title":"InfoGAN-CR and ModelCentrality: Self-supervised Model Training and Selection for Disentangling GANs","date":"2019-06-14","arxiv_id":"1906.06034","repositories_listed":1,"syntology":null},{"url":"/paper/resampling-based-assessment-of-robustness-to","slug":"resampling-based-assessment-of-robustness-to","title":"Variational Resampling Based Assessment of Deep Neural Networks under Distribution Shift","date":"2019-06-07","arxiv_id":"1906.02972","repositories_listed":1,"syntology":null},{"url":"/paper/190600531","slug":"190600531","title":"Model selection for contextual bandits","date":"2019-06-03","arxiv_id":"1906.00531","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/190600531#ran","syntology_url":"https://syntology.ai/paper/1906.00531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00531"}},"official":{"repos":["akshaykr/oracle_cb"],"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/infaas-managed-model-less-inference-serving","slug":"infaas-managed-model-less-inference-serving","title":"INFaaS: A Model-less and Managed Inference Serving System","date":"2019-05-30","arxiv_id":"1905.13348","repositories_listed":1,"syntology":null},{"url":"/paper/cold-case-the-lost-mnist-digits","slug":"cold-case-the-lost-mnist-digits","title":"Cold Case: The Lost MNIST Digits","date":"2019-05-25","arxiv_id":"1905.10498","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-gaussian-process-modulated-hawkes","slug":"sparse-gaussian-process-modulated-hawkes","title":"Variational Inference for Sparse Gaussian Process Modulated Hawkes Process","date":"2019-05-25","arxiv_id":"1905.10496","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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/sparse-gaussian-process-modulated-hawkes#ran","syntology_url":"https://syntology.ai/paper/1905.10496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10496"}},"official":{"repos":["RuiZhang2016/Variational-Inference-for-SGP-Modulated-Hawkes-Process"],"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/distributionally-robust-formulation-and-model","slug":"distributionally-robust-formulation-and-model","title":"Distributionally Robust Formulation and Model Selection for the Graphical Lasso","date":"2019-05-22","arxiv_id":"1905.08975","repositories_listed":1,"syntology":null},{"url":"/paper/catastrophic-forgetting-still-a-problem-for","slug":"catastrophic-forgetting-still-a-problem-for","title":"Catastrophic forgetting: still a problem for DNNs","date":"2019-05-20","arxiv_id":"1905.08077","repositories_listed":1,"syntology":null},{"url":"/paper/practical-bayesian-optimization-with","slug":"practical-bayesian-optimization-with","title":"Practical Bayesian Optimization with Threshold-Guided Marginal Likelihood Maximization","date":"2019-05-18","arxiv_id":"1905.07540","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-neural-networks-at-finite","slug":"bayesian-neural-networks-at-finite","title":"Bayesian Neural Networks at Finite Temperature","date":"2019-04-08","arxiv_id":"1904.04154","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-dimensionality-and-complexity","slug":"simultaneous-dimensionality-and-complexity","title":"Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering","date":"2019-04-05","arxiv_id":"1904.02926","repositories_listed":1,"syntology":null},{"url":"/paper/easy-transfer-learning-by-exploiting-intra","slug":"easy-transfer-learning-by-exploiting-intra","title":"Easy Transfer Learning By Exploiting Intra-domain Structures","date":"2019-04-02","arxiv_id":"1904.01376","repositories_listed":1,"syntology":null},{"url":"/paper/combining-model-and-parameter-uncertainty-in","slug":"combining-model-and-parameter-uncertainty-in","title":"Combining Model and Parameter Uncertainty in Bayesian Neural Networks","date":"2019-03-18","arxiv_id":"1903.07594","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":2,"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/combining-model-and-parameter-uncertainty-in#ran","syntology_url":"https://syntology.ai/paper/1903.07594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07594"}},"official":null}},{"url":"/paper/bayesian-allocation-model-inference-by","slug":"bayesian-allocation-model-inference-by","title":"Bayesian Allocation Model: Inference by Sequential Monte Carlo for Nonnegative Tensor Factorizations and Topic Models using Polya Urns","date":"2019-03-11","arxiv_id":"1903.04478","repositories_listed":1,"syntology":null},{"url":"/paper/convex-covariate-clustering-for","slug":"convex-covariate-clustering-for","title":"Convex Covariate Clustering for Classification","date":"2019-03-05","arxiv_id":"1903.01680","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-in-policy-evaluation-new","slug":"machine-learning-in-policy-evaluation-new","title":"Machine learning in policy evaluation: new tools for causal inference","date":"2019-03-01","arxiv_id":"1903.00402","repositories_listed":1,"syntology":null},{"url":"/paper/regularity-normalization-constraining","slug":"regularity-normalization-constraining","title":"Unsupervised Attention Mechanism across Neural Network Layers","date":"2019-02-27","arxiv_id":"1902.10658","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-with-weighted-inner","slug":"representation-learning-with-weighted-inner","title":"Representation Learning with Weighted Inner Product for Universal Approximation of General Similarities","date":"2019-02-27","arxiv_id":"1902.10409","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-restrictive-federated-model","slug":"high-dimensional-restrictive-federated-model","title":"High Dimensional Restrictive Federated Model Selection with multi-objective Bayesian Optimization over shifted distributions","date":"2019-02-24","arxiv_id":"1902.08999","repositories_listed":1,"syntology":null},{"url":"/paper/learning-counterfactual-representations-for","slug":"learning-counterfactual-representations-for","title":"Learning Counterfactual Representations for Estimating Individual Dose-Response Curves","date":"2019-02-03","arxiv_id":"1902.00981","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-counterfactual-representations-for#ran","syntology_url":"https://syntology.ai/paper/1902.00981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00981"}},"official":{"repos":["d909b/drnet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rescaling-and-other-forms-of-unsupervised","slug":"rescaling-and-other-forms-of-unsupervised","title":"On the cross-validation bias due to unsupervised pre-processing","date":"2019-01-25","arxiv_id":"1901.08974","repositories_listed":1,"syntology":null},{"url":"/paper/generic-adaptation-strategies-for-automated","slug":"generic-adaptation-strategies-for-automated","title":"Automated Adaptation Strategies for Stream Learning","date":"2018-12-27","arxiv_id":"1812.10793","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-neural-networks-for-fuzz-testing","slug":"recurrent-neural-networks-for-fuzz-testing","title":"Recurrent Neural Networks for Fuzz Testing Web Browsers","date":"2018-12-12","arxiv_id":"1812.04852","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-structure-learning-by-recursive","slug":"bayesian-structure-learning-by-recursive","title":"Bayesian Structure Learning by Recursive Bootstrap","date":"2018-09-13","arxiv_id":"1809.04828","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-sparse-reconstruction-a-brute-force","slug":"bayesian-sparse-reconstruction-a-brute-force","title":"Bayesian sparse reconstruction: a brute-force approach to astronomical imaging and machine learning","date":"2018-09-12","arxiv_id":"1809.04598","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-discovery-of-pdes-in-complex","slug":"data-driven-discovery-of-pdes-in-complex","title":"Data-driven discovery of PDEs in complex datasets","date":"2018-08-31","arxiv_id":"1808.10788","repositories_listed":1,"syntology":null},{"url":"/paper/multiclass-universum-svm","slug":"multiclass-universum-svm","title":"Multiclass Universum SVM","date":"2018-08-23","arxiv_id":"1808.08111","repositories_listed":1,"syntology":null},{"url":"/paper/oboe-collaborative-filtering-for-automl","slug":"oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","arxiv_id":"1808.03233","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/oboe-collaborative-filtering-for-automl#ran","syntology_url":"https://syntology.ai/paper/1808.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03233"}},"official":{"repos":["udellgroup/oboe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/using-j-k-fold-cross-validation-to-reduce-1","slug":"using-j-k-fold-cross-validation-to-reduce-1","title":"Using J-K-fold Cross Validation To Reduce Variance When Tuning NLP Models","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/algebraic-equivalence-of-linear-structural","slug":"algebraic-equivalence-of-linear-structural","title":"Algebraic Equivalence of Linear Structural Equation Models","date":"2018-07-10","arxiv_id":"1807.03527","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-boolean-tensor-decomposition","slug":"probabilistic-boolean-tensor-decomposition","title":"Probabilistic Boolean Tensor Decomposition","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"e15664fefbc439a2118c2b104e1d7cf9948f8c9152a260eb07149c68b957168f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}