{"id":"W2505519777","doi":"10.48550/arxiv.1411.0712","title":"Complexity Bounds for MCMC via Diffusion Limits","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Limit (mathematics); Random walk; Markov chain; Metric (unit); Mathematics; Mathematical optimization; Applied mathematics; Metropolis–Hastings algorithm; Markov process; Diffusion; Algorithm; Monte Carlo method; Computer science; Statistical physics; Statistics; Physics; Mathematical analysis; Economics","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.0008835944,0.0004747622,0.0008011304,0.0002015483,0.0002780197,0.00006346632,0.0007700162,0.0005668789,0.00004716942],"category_scores_gemma":[0.0003700895,0.0005116174,0.0005806675,0.0001706538,0.0001971613,0.00007013114,0.0008631658,0.0005521717,0.000001245617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002356797,"about_ca_system_score_gemma":0.00009052986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009165772,"about_ca_topic_score_gemma":0.0002229292,"domain_scores_codex":[0.9977803,0.0003094444,0.0003323604,0.0009974795,0.0001075319,0.000472949],"domain_scores_gemma":[0.9969281,0.0008199157,0.0004436088,0.001281288,0.0002883803,0.0002387029],"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.0004766826,0.0006065746,0.001181787,0.002560071,0.0003941241,0.00007959213,0.0005127859,0.002035827,0.000617322,0.9767822,0.01076795,0.003985077],"study_design_scores_gemma":[0.001488965,0.0001513124,0.0001411608,0.0002417579,0.0004528882,0.000004771986,0.0001230513,0.283467,0.0002937553,0.6950979,0.01764278,0.0008946914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3234295,0.0000230123,0.6677716,0.00006479675,0.0008266316,0.0007001948,0.00006797531,0.0001868732,0.006929371],"genre_scores_gemma":[0.9577584,0.00007411709,0.03215552,0.0001296868,0.0004023052,0.000006058896,0.00008391536,0.00007890924,0.009311098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6356161,"threshold_uncertainty_score":0.9997336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2926510276963673,"score_gpt":0.2792149404831748,"score_spread":0.0134360872131925,"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."}}