{"id":"W7139410430","doi":"","title":"Embarrassingly Parallel Sequential Markov-chain Monte Carlo for Large Sets of Time Series","year":2016,"lang":"","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Università Ca' Foscari Venezia; Global Risk Institute in Financial Services","keywords":"Markov chain Monte Carlo; Embarrassingly parallel; Monte Carlo method; Metropolis–Hastings algorithm; Particle filter; Computation; Series (stratigraphy); Bayesian probability; Approximate Bayesian computation; Hybrid Monte Carlo","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005125263,0.000946851,0.001319109,0.001049378,0.001568718,0.002169568,0.002206164,0.001385154,0.006074375],"category_scores_gemma":[0.0189268,0.0009918266,0.0009824558,0.00163664,0.001756438,0.002526393,0.002053391,0.003148061,0.001637155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00214657,"about_ca_system_score_gemma":0.005067941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01538742,"about_ca_topic_score_gemma":0.02539048,"domain_scores_codex":[0.9981236,0.0009207239,0.00008728082,0.0003246193,0.0004433822,0.0001004021],"domain_scores_gemma":[0.9906013,0.007520395,0.0002622626,0.0009654991,0.0004623697,0.0001881495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001477039,0.0001273726,0.001653135,0.0001686159,0.0001029669,0.0001433498,0.0002093945,0.6794117,0.00132808,0.1844724,0.00483835,0.127397],"study_design_scores_gemma":[0.00002081424,0.000009809816,0.0001099043,0.00001104819,0.000006276151,0.00001677813,0.00001362592,0.9179146,0.0004302583,0.07944778,0.002009012,0.00001005148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003329679,0.000116005,0.9941956,0.0002754318,0.00002545146,0.00004661722,0.00005508458,0.0005765648,0.001379508],"genre_scores_gemma":[0.1095551,0.0003481539,0.886571,0.0001378836,0.00009312526,0.0003283329,0.0003183537,0.0003061303,0.002341932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01538742,"threshold_uncertainty_score":0.03059572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02724834230598475,"score_gpt":0.2717494174250328,"score_spread":0.2445010751190481,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}