{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008709618,0.002080328,0.001978794,0.003242373,0.002176842,0.004420527,0.003993234,0.003312749,0.008144322],"category_scores_gemma":[0.07984432,0.001323927,0.002714132,0.0025879,0.005510387,0.01045808,0.006838216,0.009360201,0.001217656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005777559,"about_ca_system_score_gemma":0.003087594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003992094,"about_ca_topic_score_gemma":0.003553794,"domain_scores_codex":[0.9931512,0.002318246,0.0003535181,0.001192298,0.002488935,0.0004957337],"domain_scores_gemma":[0.9152943,0.07053965,0.003260788,0.005893312,0.003417694,0.001594293],"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.0001117408,0.00007518569,0.001411273,0.0002714856,0.0001130772,0.000125004,0.0002531096,0.2009236,0.001783565,0.7739162,0.002571319,0.01844448],"study_design_scores_gemma":[0.00001726117,0.00001961379,0.0001722635,0.00004799825,0.00001852175,0.00005477788,0.00001721432,0.5702174,0.0009022523,0.4270016,0.001505959,0.00002498127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01595721,0.001661487,0.9682083,0.002333303,0.0001582097,0.000129291,0.0002796086,0.0004868366,0.01078577],"genre_scores_gemma":[0.5549922,0.003642078,0.4252099,0.001875403,0.000993498,0.001510666,0.001132097,0.001336296,0.009307772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008709618,"threshold_uncertainty_score":0.04606146,"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."}}