Unverified50% confidenceOpinionExact time
General search frameworks (such as ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) may fail under hard deadlines because they cannot guarantee a feasible solution at every iteration, whereas FPTR avoids this deficiency through transactional refinement.
1
Sources
50%
Confidence
Long-term
Relevance
11/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedTraditional retrosynthesis planning methods typically use the verifier to evaluate the entire route only after the search ends, so erroneous decisions cannot be corrected in time during the search process.72% similarUnverifiedIn agentic search, bounded retries need to be combined with error classification: transient errors (timeouts, rate limiting) are worth retrying, whereas semantic failures (queries with no results, irrelevant pages) often do not benefit from retries and require switching to query rewriting or a different data source.71% similarUnverified网格搜索穷举所有参数组合结果全面但耗时，随机搜索随机采样效率更高70% similarUnverifiedIf search API providers fail on different queries due to differing index sources, crawling strategies, and ranking algorithms, then failure events are approximately independent, and the combined joint hit rate approaches 1-(1-p)^n.69% similarUnverifiedSelection leakage refers to the search loop itself being able to read the final evaluation score, causing the model to overfit to the holdout set when the number of iterations is large enough, and is closely related to the multiple comparisons problem and p-hacking.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1137802API
curl https://kongchang.com/api/v1/knowledge/claims/1137802MCP
get_claim(id=1137802)