{"id":"W2498324117","doi":"10.1007/978-3-319-40970-2_9","title":"Learning Rate Based Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Leverage (statistics); Solver; Branching (polymer chemistry); Heuristic; Mathematical optimization; Reinforcement learning; Artificial intelligence; Optimization problem; Machine learning; Theoretical computer science; Algorithm; Mathematics; Programming language","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.002415431,0.001304557,0.00163654,0.001565416,0.0006884526,0.001576912,0.002943619,0.001903189,0.01430406],"category_scores_gemma":[0.01268432,0.0008015594,0.001301847,0.001814415,0.001281856,0.002552847,0.002096713,0.004422565,0.002604212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002207282,"about_ca_system_score_gemma":0.002437595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707711,"about_ca_topic_score_gemma":0.004105716,"domain_scores_codex":[0.9982826,0.0006962633,0.00008297492,0.0002714068,0.0004594626,0.0002074212],"domain_scores_gemma":[0.9931099,0.005246103,0.0002279555,0.0006177115,0.0005570158,0.0002413552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005111845,0.0002522055,0.0007116941,0.0003588816,0.00007594336,0.00007030314,0.0001291845,0.518254,0.003116846,0.08370535,0.01179708,0.3810174],"study_design_scores_gemma":[0.00004204389,0.00004497395,0.00008531537,0.00003892828,0.00001748895,0.00002017854,0.00001174688,0.9487786,0.000736583,0.04903797,0.001176701,0.00000952217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01365851,0.0009728248,0.9701774,0.0004599244,0.000160426,0.0001454621,0.0002039861,0.002310615,0.01191079],"genre_scores_gemma":[0.2960051,0.0007323078,0.6886036,0.0004494601,0.0002495836,0.000487831,0.00112584,0.001056969,0.0112894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01430406,"threshold_uncertainty_score":0.0478518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02385397396974076,"score_gpt":0.2756599481661304,"score_spread":0.2518059741963897,"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."}}