{"id":"W2144283734","doi":"10.1609/socs.v2i1.18207","title":"Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Generalization; Heuristic; Beam search; Incremental heuristic search; Task (project management); Bidirectional search; Search algorithm; Computer science; Best-first search; Quality (philosophy); Algorithm; Sequence (biology); Beam stack search; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","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.002995263,0.001058185,0.001634894,0.00109844,0.001110131,0.002466656,0.002038552,0.002841275,0.007527038],"category_scores_gemma":[0.02490882,0.0006504702,0.001491489,0.001301952,0.002276144,0.003954047,0.001758901,0.002448017,0.001484909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001590697,"about_ca_system_score_gemma":0.002452712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002502432,"about_ca_topic_score_gemma":0.004016946,"domain_scores_codex":[0.9969177,0.001144103,0.0001851262,0.0007814175,0.0006106313,0.0003610174],"domain_scores_gemma":[0.9899135,0.006017977,0.0005146264,0.002523755,0.000810395,0.0002197769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006511824,0.00020416,0.003262083,0.0004875817,0.0002412128,0.0002963315,0.000265807,0.4350476,0.003198768,0.3083254,0.01694464,0.2310753],"study_design_scores_gemma":[0.00007693207,0.00008443358,0.0002663334,0.00005139081,0.00004109278,0.0001508314,0.00007308915,0.7231748,0.001306884,0.2691971,0.005555857,0.00002128688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03661723,0.0007871254,0.9446758,0.001269361,0.0002221988,0.0001085636,0.0003311536,0.001455305,0.01453319],"genre_scores_gemma":[0.4783013,0.0004239254,0.5094555,0.0007807881,0.0001425468,0.0002730848,0.0007908179,0.0005870854,0.009244862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007527038,"threshold_uncertainty_score":0.0251804,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01421099653445188,"score_gpt":0.2573462545962829,"score_spread":0.243135258061831,"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."}}