{"id":"W3083184497","doi":"10.1016/j.orl.2020.08.014","title":"Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Sampling (signal processing); Algorithm; Polyhedron; Computer science; Markov chain Monte Carlo; Set (abstract data type); Pipeline (software); Boundary (topology); Data set; Artificial intelligence; Pattern recognition (psychology); Mathematics; Bayesian probability; Computer vision","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.001007044,0.00007287815,0.00009430917,0.00004566269,0.0005667435,0.0003900051,0.001761236,0.0000154854,0.00004230282],"category_scores_gemma":[0.0001643511,0.00005538307,0.00002463237,0.0003359041,0.00007059496,0.0005443007,0.0005104289,0.0002163825,0.00001249584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002392811,"about_ca_system_score_gemma":0.00008658799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001823563,"about_ca_topic_score_gemma":0.0001113792,"domain_scores_codex":[0.9983224,0.0003406711,0.0002078447,0.0004058157,0.0004920998,0.0002312025],"domain_scores_gemma":[0.9986085,0.0003669304,0.00002389853,0.0007836791,0.0001252377,0.00009180479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001649413,0.0001469164,0.0003286938,0.00001872257,0.0001004593,0.000003813625,0.009785055,0.03710837,0.05266955,0.006524995,0.0274852,0.8658117],"study_design_scores_gemma":[0.000323413,0.0001141215,0.000342095,0.000008218022,0.000003400094,4.501119e-7,0.000279028,0.9878913,0.0006624606,0.00004514537,0.01026625,0.00006408532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009333368,0.00003488161,0.8978763,0.09203846,0.00006656504,0.0003997523,0.0002065929,0.00003158352,0.00001247331],"genre_scores_gemma":[0.07886087,0.000008521875,0.9150442,0.004371295,0.0005184163,0.0000787175,0.001087,0.00001214737,0.00001880486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.950783,"threshold_uncertainty_score":0.435899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2966483137067856,"score_gpt":0.4570154344034947,"score_spread":0.1603671206967091,"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."}}