{"id":"W2084668838","doi":"10.1016/j.spa.2007.12.005","title":"Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234","year":2008,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":105,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Algorithm; Metropolis–Hastings algorithm; Applied mathematics; Mathematical optimization; Statistics; Monte Carlo method; Markov chain Monte Carlo","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01605628,0.001481282,0.00255057,0.001779164,0.001602415,0.003528679,0.003845279,0.002612951,0.008900256],"category_scores_gemma":[0.08676199,0.001372239,0.001404796,0.001617778,0.004040934,0.008412846,0.003558718,0.00683081,0.001851663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003082204,"about_ca_system_score_gemma":0.003723035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003503657,"about_ca_topic_score_gemma":0.002781352,"domain_scores_codex":[0.993064,0.004326362,0.0002432504,0.0007802065,0.001019089,0.0005671],"domain_scores_gemma":[0.9166231,0.07343544,0.001486683,0.003893974,0.003304569,0.001256288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000239879,0.0001380309,0.0007413942,0.0001756015,0.00006605245,0.00004242227,0.0001947379,0.1482018,0.0006535765,0.8121417,0.004208717,0.03319612],"study_design_scores_gemma":[0.00004984274,0.0000409677,0.0001453918,0.00005345397,0.00002566441,0.00002718201,0.0000266987,0.6159455,0.0006248625,0.3813668,0.001664349,0.00002930441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01455015,0.001264034,0.9763415,0.001159681,0.0001717071,0.00009937709,0.00007291971,0.000301336,0.00603922],"genre_scores_gemma":[0.4858315,0.00302669,0.4891175,0.001040955,0.0008932082,0.0009878107,0.0004027551,0.0009018077,0.01779786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01605628,"threshold_uncertainty_score":0.08491474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04884437887349389,"score_gpt":0.3535913551804132,"score_spread":0.3047469763069193,"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."}}