arXiv:1304.1509
Heuristic Search as Evidential Reasoning
원문 초록
BPS, the Bayesian Problem Solver, applies probabilistic inference and decision-theoretic control to flexible, resource-constrained problem-solving. This paper focuses on the Bayesian inference mechanism in BPS, and contrasts it with those of traditional heuristic search techniques. By performing sound inference, BPS can outperform traditional techniques with significantly less computational effort. Empirical tests on the Eight Puzzle show that after only a few hundred node expansions, BPS makes better decisions than does the best existing algorithm after several million node expansions
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Reinforcement Learning with Large Language Model Priors
SQL-o1: Automatic Text-to-SQL Program Synthesis via Self-Reward Heuristic Search
Statistical Machine Learning for Astronomy -- A Textbook
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
Generative Diffusion Receivers: Achieving Pilot-Efficient MIMO-OFDM Communications
토론
이 논문과 연결된 포럼 글이 아직 없습니다.