🧠 Comparing Hyperparameter Optimization Algorithms
Compare different hyperparameter optimization algorithms. Learn which algorithm to choose based on your problem characteristics and constraints.
A 3D loss landscape shows how grid search, random search, Bayesian optimization and genetic algorithms explore a hyperparameter space differently under the same trial budget.
🔬 What It Demonstrates
Each strategy places trial markers on the loss surface using its real placement logic — fixed lattice, uniform random, exploration/exploitation around the current best, or an evolving population — so you can watch how quickly each converges on the global minimum.
🎮 How to Use
Pick an algorithm, set the trial budget and landscape ruggedness, then watch trials populate the surface. The gold beacon marks the best loss found so far; the stats panel tracks how many trials it took to find it.
💡 Did You Know?
Bergstra & Bengio (2012) showed random search often matches grid search's results with far fewer trials, because most hyperparameters have little effect on performance — grid search wastes budget exploring them exhaustively.
Compare different hyperparameter optimization algorithms. Learn which algorithm to choose based on your problem characteristics and constraints.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install