Riemannian Geometry of Optimal Rebalancing in Dynamic Weight Automated Market Makers
Matthew Willetts

TL;DR
This paper explores the Riemannian geometry underlying optimal rebalancing in dynamic-weight AMMs, revealing that KL divergence defines the cost and SLERP provides an efficient interpolation method.
Contribution
It establishes the Fisher-Rao metric as natural for weight rebalancing and connects SLERP to geodesics on the weight simplex, extending prior heuristics.
Findings
KL divergence measures per-step log loss in rebalancing.
SLERP interpolates weights along geodesics, matching prior heuristics.
SLERP's sub-optimality scales with weight change magnitude and number of steps.
Abstract
We show that when a dynamic-weight AMM rebalances by creating arbitrage opportunities, the per-step log loss is the KL divergence between successive weight vectors. The Fisher-Rao metric is therefore the natural Riemannian metric on the weight simplex. The loss-minimising interpolation under the leading-order expansion of this KL cost is SLERP (Spherical Linear Interpolation) in the Hellinger coordinates : a geodesic on the positive orthant of the unit sphere, traversed at constant speed. The SLERP midpoint equals the (AM+GM)/normalise heuristic of prior work (Willetts & Harrington, 2024), so the heuristic lies on the geodesic. This identity holds for any number of tokens and any magnitude of weight change; using this link, all dyadic points on the geodesic can be reached by recursive AM-GM bisection without trigonometric functions. SLERP's relative sub-optimality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
