边际价格优化
Marginal Price Optimization
AI总结:
针对AMM驱动市场的最优路由和套利问题,提出通过边界参数化将高维凸优化简化为低维根求解的新框架,在速度(较Clarabel提升200倍)和鲁棒性上更优,仅无限集中流动性时需近似。
摘要:
我们提出了一个新的框架,用于AMM驱动市场中的最优路由和套利。该框架通过将搜索限制在最优空间的边界上,改进了原始的最佳实践凸优化方法。我们可以使用一组价格对该边界进行参数化,将一个可能维度极高的优化问题(每条曲线2个优化变量)简化为一个维度低得多的根求解问题(每个代币1个优化变量,与曲线数量无关)。我们的重构类似于原始凸问题重构后的对偶问题。我们证明,除了无限集中流动性的情况(我们提供了合适的近似)外,我们的问题重构与原始公式等价。我们的公式在速度方面远优于原始公式——与新的CVXPY默认求解器Clarabel相比,速度提升高达200倍——且在鲁棒性方面也更优,尤其是在杠杆曲线上。
英文摘要:
We introduce a new framework for optimal routing and arbitrage in AMM driven markets. This framework improves on the original best-practice convex optimization by restricting the search to the boundary of the optimal space. We can parameterize this boundary using a set of prices, and a potentially very high dimensional optimization problem (2 optimization variables per curve) gets reduced to a much lower dimensional root finding problem (1 optimization variable per token, regardless of the number of the curves). Our reformulation is similar to the dual problem of a reformulation of the original convex problem. We show our reformulation of the problem is equivalent to the original formulation except in the case of infinitely concentrated liquidity, where we provide a suitable approximation. Our formulation performs far better than the original one in terms of speed - we obtain an improvement of up to 200x against Clarabel, the new CVXPY default solver - and robustness, especially on levered curves.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。