Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Your description is right but might be misleading, because "so as to achieve a better global solution" suggests that somehow the algorithm knows that the temporary worse score is going to help. It doesn't (it couldn't!), and indeed most of the time the temporary worse score is simply a temporary worse score.</p> <p>Here's the idea. You're stumbling around in the dark, looking for a deep hole. If you just keep going downhill then you'll end up in the nearest hole to where you start, which may not be very deep. So you deliberately move around somewhat at random, letting yourself climb out of shallow holes if you get into them. So shallow holes are mostly invisible to you; but if you happen to fall into a really deep hole you'll likely stay in it.</p> <p>Now, of course eventually you do want to find the bottom of whatever hole you're in. So you start off with a lot of randomness and gradually reduce it, so that initially you're just wandering around almost completely at random (unless you have the good fortune to fall into a really deep hole), but later on -- once you hope you've found the deepest hole you can -- you can locate its bottom more accurately.</p> <p>The physical analogy is with the process of crystal formation as a liquid cools. You get bigger (lower overall energy, nearer to a global optimum) crystals by cooling slowly. Temperature = randomness, and the underlying process is rather similar to that of simulated annealing. Or, rather, simulated annealing is rather similar to a process of slow crystal growth.</p> <p>As far as mechanism goes: the usual setup is that you try steps at random, always accept them if they make things better, and if they're worse accept them with probability that looks like exp(-d/T) where d is how much worse the step makes things and T, the "temperature", is a measure of how much random nonsense you're prepared to put up with at the moment for the sake of exploring the solution space more. You gradually reduce T. As T->0 the probability of accepting a step that makes things worse at all goes to zero.</p> <p>The details of how you generate your random steps and how you reduce the "temperature" are where most of the actual work goes :-).</p>
    singulars
    1. This table or related slice is empty.
    1. POUnderstanding simulated annealing- conceptually
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USGareth McCaughan
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POUnderstanding simulated annealing- conceptually
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COthanks, this clarified alot.
      singulars
      1. PO
      1. USRoy
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload