{"id":"W3021867977","doi":"10.48550/arxiv.1904.12157","title":"Optimal Scaling of Random-Walk Metropolis Algorithms on General Target Distributions","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Scaling; Random walk; Markov chain Monte Carlo; Bayesian probability; Metropolis–Hastings algorithm; Mathematics; Distribution (mathematics); Mathematical optimization; Algorithm; Prior probability; Limit (mathematics); Applied mathematics; Diffusion; Probability distribution; Statistical physics; Computer science; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008759022,0.0004370206,0.0009445248,0.0003040772,0.0001342752,0.00003223542,0.0006469238,0.0004547443,0.00009913112],"category_scores_gemma":[0.0003859112,0.000451605,0.0006994571,0.0003387223,0.000163571,0.00007454021,0.0008303783,0.0007151589,0.000001575954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003273553,"about_ca_system_score_gemma":0.0001625376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001949325,"about_ca_topic_score_gemma":0.000008197263,"domain_scores_codex":[0.9977322,0.0004013389,0.0004207934,0.0008070623,0.0001638138,0.0004748103],"domain_scores_gemma":[0.9972952,0.0005941634,0.0005015988,0.001143546,0.0002827251,0.0001827374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007795854,0.0007198874,0.001039731,0.000897073,0.001012471,0.0002054178,0.0003582578,0.4082979,0.0003101927,0.5819275,0.003880991,0.000570941],"study_design_scores_gemma":[0.006725163,0.0003026703,0.0001173834,0.000631746,0.001259811,0.000008915011,0.0007553172,0.9082114,0.009123486,0.06777695,0.003426629,0.001660574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4014395,0.00005377499,0.5916736,0.00002484672,0.0005949306,0.0004323308,0.0005370392,0.00007590948,0.005168143],"genre_scores_gemma":[0.9160347,0.0001475964,0.07817085,0.0000237825,0.0002343618,0.000002468283,0.0001729667,0.00005468914,0.005158595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5145952,"threshold_uncertainty_score":0.9997936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1214735276320388,"score_gpt":0.2657048954604161,"score_spread":0.1442313678283773,"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."}}