border_search_a_minima_hopping
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
border_search_a_minima_hopping [2012/02/13 11:31] prokop |
border_search_a_minima_hopping [2012/02/13 11:36] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | |||
| - | **Vyhoda minimahopingu** | ||
| - | Minimahoping pouziva dlouhe skoky proto je schopnen nalezt nove lokalni minimum mnohem rychleji nez metadynamika nebo border search | ||
| - | |||
| - | **Problemem minimahopingu** | ||
| - | Jako kazdy jiny Monte-Carlo techniky je, ze stavovy prostor prochazi nesystematicky bez vyuziti pameti. Tim zbytence sampluje mnohekrat podobne konfigurace. | ||
| - | |||
| - | **Reseni pomoci bordersearch** | ||
| - | Bordersearch muze tento proces vyznamne zrychlit, pokud vyuzije zkonstruovanou velice hrubou mrizku (1 Angstroem) pro systematicke ukladani informace z minimahopingu tak, aby nove lokalni minima uz nenavstevoval. | ||
| - | |||
| - | Narozdil od klasickeho Border-Search, tento algoritmus dovoluje relaxovat i stupne volnosti prohledavaneho subprostoru (tedy meta-parametry) nikoli pouze ostatni geometrii. S tim suvisi nezbytnost drobne modifikace algoritmu. | ||
| - | |||
| - | Bordersearch si pamatuje pro danou pozici | ||
| - | * Energii na pocaku relaxace (tedy pri skoku do prostred policka) | ||
| - | * Energii na konci relaxace (tedy pri opousteni policka, nebo v lokalnim minimu naleza li se v policku) | ||
| - | * Zda je lokalni minimum v policku nebo zda je v policku sousednim - ve kterem? - To poskytne informace o ** //Bazenech// ** | ||
| - | |||
| - | |||
| - | |||
border_search_a_minima_hopping.txt ยท Last modified: 2012/02/13 11:36 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
