{"id":"W2397806795","doi":"10.1609/socs.v3i1.18236","title":"Search-Aware Conditions for Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Incremental heuristic search; Speedup; Beam search; Heuristic; Bidirectional search; Iterative deepening depth-first search; Computer science; Search algorithm; Best-first search; Beam stack search; Quality (philosophy); Search problem; Field (mathematics); Guided Local Search; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Parallel computing","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.007131906,0.001448003,0.002443899,0.002638133,0.001163656,0.003793955,0.002605509,0.00373912,0.00965452],"category_scores_gemma":[0.09502227,0.001270485,0.002039036,0.001581052,0.004859218,0.008646368,0.003717572,0.006174174,0.001603264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001821684,"about_ca_system_score_gemma":0.003481427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001824583,"about_ca_topic_score_gemma":0.001762492,"domain_scores_codex":[0.9905719,0.002702831,0.000685261,0.001620436,0.003134255,0.00128532],"domain_scores_gemma":[0.9018087,0.07675567,0.005297037,0.00687384,0.007132624,0.002131978],"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.0008761931,0.0001566928,0.002535789,0.0005181627,0.000108549,0.0006557907,0.0005583382,0.3907099,0.006218934,0.5499078,0.005992463,0.04176138],"study_design_scores_gemma":[0.0001141188,0.0001646888,0.0004244997,0.0001057791,0.0000354998,0.0002676403,0.00009861225,0.7377587,0.003299926,0.2550664,0.002609558,0.00005464943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02641202,0.0004922755,0.959738,0.0009468821,0.000140836,0.0002206198,0.0003373496,0.0006665122,0.01104552],"genre_scores_gemma":[0.6440734,0.000860068,0.3463781,0.0007306632,0.0004103857,0.0009260562,0.00108839,0.0005817724,0.004951202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00965452,"threshold_uncertainty_score":0.03771758,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02591596339315059,"score_gpt":0.2807167400186607,"score_spread":0.2548007766255101,"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."}}