Bayesian Simulated Annealing — Global Optimization with Bayesian Priors
Bayesian Simulated Annealing (BSA) integrates Bayesian prior knowledge about the objective landscape into the simulated annealing search process. By encoding beliefs about promising regions as prior distributions and updating them as the search progresses, BSA focuses computational effort on high-probability areas of the solution space, accelerating convergence and improving solution quality compared to uninformed SA.
Loe meetodi täielikku kirjeldust
Selle osa lugemiseks logi sisse tasuta kontoga.
Method map
The neighbourhood of related methods — select a node to explore.
Allikad
- Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671–680. DOI: 10.1126/science.220.4598.671 ↗
- Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721–741. DOI: 10.1109/TPAMI.1984.4767596 ↗
Kuidas sellele lehele viidata
ScholarGate. (2026, June 3). Bayesian Simulated Annealing — Probabilistic global optimization with Bayesian priors on the energy landscape. ScholarGate. https://scholargate.app/et/simulation/bayesian-simulated-annealing
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesilik geneetiline algoritmSimulatsioon↔ compare
- Bayesi optimeerimine – järjestikune mudelipõhine hüperparameetrite häälestamineOptimeerimine↔ compare
- Genetiline algoritmOptimeerimine↔ compare
- Markov Chain Monte Carlo (MCMC)Simulatsioon↔ compare
- Simulated AnnealingOptimeerimine↔ compare
Sellele viitavad
Märkasid sellel lehel viga? Teata sellest või paku parandust →