Ask what should change when the equation is manipulated, then let the visualization test that expectation.
Foundation Lab
Bregman Divergence & Mirror Descent
Explains why different geometries suit different problems—simplex needs KL, not Euclidean
D_\Phi(p, q) = \Phi(p) - \Phi(q) - \langle \nabla\Phi(q), p - q \rangleSelected Foundation Object
Keep the equation fixed; move through the evidence.
Euclidean gradient descent is ONE choice; mirror descent is the general framework
D_\Phi(p, q) = \Phi(p) - \Phi(q) - \langle \nabla\Phi(q), p - q \rangleUse the runnable panel, the key equation, and canonical papers as separate forms of evidence for the same object.
The useful learning product is the reusable mechanism you can carry into another model, paper, or engineering tradeoff.
Use prerequisites, dependents, and semantic links to repair the next gap without leaving the object behind.
Why It Matters for Modern Models
- Explains why different geometries suit different problems—simplex needs KL, not Euclidean
- Exponentiated gradient (softmax updates) is mirror descent with entropy potential
- Natural gradient is Bregman geometry with Fisher information as the potential
What Tutorials Skip
What is still poorly explained in textbooks and papers:
- Euclidean gradient descent is ONE choice; mirror descent is the general framework
- The "mirror map" transforms to dual coordinates where steps are linear
- KL divergence is the Bregman divergence for probability distributions
Interactive Visualization
Core Math (Optional Deep Dive)
If you want intuition first, start with the key equation and the visualization. Come back here for the full walkthrough.
Bregman divergence generated by strictly convex :
Mirror descent:
Special cases:
- → Euclidean GD, = squared distance
- → KL divergence on simplex (exponentiated gradient)