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

Autodeleveraging as Online Learning

Author

Listed:
  • Tarun Chitra
  • Nagu Thogiti
  • Mauricio Jean Pieer Trujillo Ramirez
  • Victor Xu

Abstract

Autodeleveraging (ADL) is a last-resort loss socialization mechanism used by perpetual futures venues when liquidation and insurance buffers are insufficient to restore solvency. Despite the scale of perpetual futures markets, ADL has received limited formal treatment as a sequential control problem. This paper provides a concise formalization of ADL as online learning on a PNL-haircut domain: at each round, the venue selects a solvency budget and a set of profitable trader accounts. The profitable accounts are liquidated to cover shortfalls up to the solvency budget, with the aim of recovering exchange-wide solvency. In this model, ADL haircuts apply to positive PNL (unrealized gains), not to posted collateral principal. Using our online learning model, we provide robustness results and theoretical upper bounds on how poorly a mechanism can perform at recovering solvency. We apply our model to the October 10, 2025 Hyperliquid stress episode. The regret caused by Hyperliquid's production ADL queue is about 50\% of an upper bound on regret, calibrated to this event, while our optimized algorithm achieves about 2.6\% of the same bound. In dollar terms, the production ADL model over liquidates trader profits by up to \$51.7M. We also counterfactually evaluated algorithms inspired by our online learning framework that perform better and found that the best algorithm reduces overshoot to \$3M. Our results provide simple, implementable mechanisms for improving ADL in live perpetuals exchanges.

Suggested Citation

  • Tarun Chitra & Nagu Thogiti & Mauricio Jean Pieer Trujillo Ramirez & Victor Xu, 2026. "Autodeleveraging as Online Learning," Papers 2602.15182, arXiv.org.
  • Handle: RePEc:arx:papers:2602.15182
    as

    Download full text from publisher

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

    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:2602.15182. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.