Loading video...

Video Failed to Load

Go Home

Simulated Annealing: a stochastic optimization method inspired by nature. As "temperature" decreases, random fluctuations (that allow it to escape local minima/maxima) decrease and the particle resorts to hillclimbing. No gradient calculation required. #RStats #rayshader

218,947 views • 3 years ago •via X (Twitter)

9 Comments

@tylermorganwall.bsky.social's profile picture
@tylermorganwall.bsky.social3 years ago

(See if you can spot the two particles going "We're coming! Wait for us!!")

eno Rogue's profile picture
eno Rogue3 years ago

@Flexi23 This animation does not show the full power of SA, because not many of them have reached the global maximum. However, it seems this is because of non-optimally chosen parameters (not enough time spent at very high temperature).

Robyn Shaw's profile picture
Robyn Shaw3 years ago

@certhionyx good ol simulated annealing

Paul Ramsey's profile picture
Paul Ramsey3 years ago

@wgeary Picking out the ridge lines is a nice emergent property too. Sweet.

Damie Pak's profile picture
Damie Pak3 years ago

I never got simulated annealing but it’s amazing how much it clicks with the animation. It’s fantastic!

Waris's profile picture
Waris3 years ago

@DFintelligence tu cherchais une visualisation en stream hier pour expliquer l'optimisation de fonctions objectives

Ibrahim - إبراهيم's profile picture
Ibrahim - إبراهيم3 years ago

@saforem2 How do they know to climb up if no gradient is being computed? Or do you mean the global maximum?

@tylermorganwall.bsky.social's profile picture
@tylermorganwall.bsky.social3 years ago

@saforem2 As the "temperature" lowers, the probability of a random movement to a lower potential being accepted decreases. As T -> 0 this probability also goes to zero, and the algorithm effectively reverts to pure hillclimbing.

Jan Skerswetat's profile picture
Jan Skerswetat3 years ago

The only thing that is missing is a voice over for the last two data points climbing up the hill 😂 Great work!

Related Videos

Flexible Isosurface Extraction for Gradient-Based Mesh Optimization paper page: This work considers gradient-based mesh optimization, where we iteratively optimize for a 3D surface mesh by representing it as the isosurface of a scalar field, an increasingly common paradigm in applications including photogrammetry, generative modeling, and inverse physics. Existing implementations adapt classic isosurface extraction algorithms like Marching Cubes or Dual Contouring; these techniques were designed to extract meshes from fixed, known fields, and in the optimization setting they lack the degrees of freedom to represent high-quality feature-preserving meshes, or suffer from numerical instabilities. We introduce FlexiCubes, an isosurface representation specifically designed for optimizing an unknown mesh with respect to geometric, visual, or even physical objectives. Our main insight is to introduce additional carefully-chosen parameters into the representation, which allow local flexible adjustments to the extracted mesh geometry and connectivity. These parameters are updated along with the underlying scalar field via automatic differentiation when optimizing for a downstream task. We base our extraction scheme on Dual Marching Cubes for improved topological properties, and present extensions to optionally generate tetrahedral and hierarchically-adaptive meshes. Extensive experiments validate FlexiCubes on both synthetic benchmarks and real-world applications, showing that it offers significant improvements in mesh quality and geometric fidelity.

AK

38,452 views • 3 years ago