{"title":"Structural Bias in Heuristic Search (Student Abstract)","authors":"Alison Paredes","doi":"10.1609/socs.v16i1.27311","DOIUrl":null,"url":null,"abstract":"In this line of work, we consider the possibility that some fast heuristic search methods introduce structural bias, which can cause problems similar to sampling-bias for downstream statistical learning methods. We seek to understand the source of this kind of bias and to develop efficient alternatives. Here we present some preliminary results in developing a variation of canonical A* that can overcome the structural bias introduced by first-in-first-out duplicate detection, which we observed under the condition of variable heuristic error. These results inspire a model of greedy-best-first-search for this problem in the satisficing setting. We hope to apply our approach in a novel planning application--activity selection for agent-based modeling for epidemiology--where planning technology should avoid introducing structural bias if possible.","PeriodicalId":425645,"journal":{"name":"Symposium on Combinatorial Search","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Combinatorial Search","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/socs.v16i1.27311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this line of work, we consider the possibility that some fast heuristic search methods introduce structural bias, which can cause problems similar to sampling-bias for downstream statistical learning methods. We seek to understand the source of this kind of bias and to develop efficient alternatives. Here we present some preliminary results in developing a variation of canonical A* that can overcome the structural bias introduced by first-in-first-out duplicate detection, which we observed under the condition of variable heuristic error. These results inspire a model of greedy-best-first-search for this problem in the satisficing setting. We hope to apply our approach in a novel planning application--activity selection for agent-based modeling for epidemiology--where planning technology should avoid introducing structural bias if possible.