IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2603.05326.html

Riemannian Geometry of Optimal Rebalancing in Dynamic Weight Automated Market Makers

Author

Listed:
  • Matthew Willetts

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 $\eta_i = \sqrt{w_i}$: 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 on the full KL cost is proportional to the squared magnitude of the overall weight change and to $1/f^2$, where $f$ is the number of interpolation steps. Under driftless GBM prices, the fractional value loss from each weight update is price-independent, and the cross term between weight and price changes telescopes, so the constant-price geometry carries over. LVR exposure introduces a finite optimal step count $f^*$, which lies in the perturbative regime where SLERP remains near-optimal.

Suggested Citation

  • Matthew Willetts, 2026. "Riemannian Geometry of Optimal Rebalancing in Dynamic Weight Automated Market Makers," Papers 2603.05326, arXiv.org, revised Apr 2026.
  • Handle: RePEc:arx:papers:2603.05326
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2603.05326
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Matthew Willetts & Christian Harrington, 2024. "Optimal Rebalancing in Dynamic AMMs," Papers 2403.18737, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Matthew Willetts & Christian Harrington, 2024. "Rebalancing-versus-Rebalancing: Improving the fidelity of Loss-versus-Rebalancing," Papers 2410.23404, arXiv.org.
    2. Matthew Willetts & Christian Harrington, 2026. "Pools as Portfolios: Observed arbitrage efficiency & LVR analysis of dynamic weight AMMs," Papers 2602.22069, arXiv.org.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2603.05326. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.