A Multi-step Approach for Minimizing Risk in Decentralized Exchanges

Daniele Maria Di Nosse, Federico Gatta
{"title":"A Multi-step Approach for Minimizing Risk in Decentralized Exchanges","authors":"Daniele Maria Di Nosse, Federico Gatta","doi":"arxiv-2406.07200","DOIUrl":null,"url":null,"abstract":"Decentralized Exchanges are becoming even more predominant in today's\nfinance. Driven by the need to study this phenomenon from an academic\nperspective, the SIAG/FME Code Quest 2023 was announced. Specifically,\nparticipating teams were asked to implement, in Python, the basic functions of\nan Automated Market Maker and a liquidity provision strategy in an Automated\nMarket Maker to minimize the Conditional Value at Risk, a critical measure of\ninvestment risk. As the competition's winning team, we highlight our approach\nin this work. In particular, as the dependence of the final return on the\ninitial wealth distribution is highly non-linear, we cannot use standard ad-hoc\napproaches. Additionally, classical minimization techniques would require a\nsignificant computational load due to the cost of the target function. For\nthese reasons, we propose a three-step approach. In the first step, the target\nfunction is approximated by a Kernel Ridge Regression. Then, the approximating\nfunction is minimized. In the final step, the previously discovered minimum is\nutilized as the starting point for directly optimizing the desired target\nfunction. By using this procedure, we can both reduce the computational\ncomplexity and increase the accuracy of the solution. Finally, the overall\ncomputational load is further reduced thanks to an algorithmic trick concerning\nthe returns simulation and the usage of Cython.","PeriodicalId":501128,"journal":{"name":"arXiv - QuantFin - Risk Management","volume":"111 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - QuantFin - Risk Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.07200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Decentralized Exchanges are becoming even more predominant in today's finance. Driven by the need to study this phenomenon from an academic perspective, the SIAG/FME Code Quest 2023 was announced. Specifically, participating teams were asked to implement, in Python, the basic functions of an Automated Market Maker and a liquidity provision strategy in an Automated Market Maker to minimize the Conditional Value at Risk, a critical measure of investment risk. As the competition's winning team, we highlight our approach in this work. In particular, as the dependence of the final return on the initial wealth distribution is highly non-linear, we cannot use standard ad-hoc approaches. Additionally, classical minimization techniques would require a significant computational load due to the cost of the target function. For these reasons, we propose a three-step approach. In the first step, the target function is approximated by a Kernel Ridge Regression. Then, the approximating function is minimized. In the final step, the previously discovered minimum is utilized as the starting point for directly optimizing the desired target function. By using this procedure, we can both reduce the computational complexity and increase the accuracy of the solution. Finally, the overall computational load is further reduced thanks to an algorithmic trick concerning the returns simulation and the usage of Cython.
分散式交易所风险最小化的多步骤方法
去中心化交易所在当今金融领域正变得越来越重要。为了从学术角度研究这一现象,SIAG/FME 宣布举办 2023 年代码竞赛(SIAG/FME Code Quest 2023)。具体来说,参赛团队需要用 Python 实现自动做市商的基本功能和自动做市商的流动性供应策略,以最大限度地降低风险条件值(衡量投资风险的重要指标)。作为比赛的获胜团队,我们在本作品中重点介绍了我们的方法。特别是,由于最终回报与初始财富分布的关系是高度非线性的,因此我们不能使用标准的临时方法。此外,由于目标函数的成本,经典的最小化技术需要大量的计算负荷。为此,我们提出了一种分三步的方法。第一步,用核岭回归逼近目标函数。然后,对近似函数进行最小化。最后一步,利用之前发现的最小值作为起点,直接优化所需的目标函数。通过使用这一程序,我们既能降低计算复杂度,又能提高求解的精确度。最后,得益于返回模拟的算法技巧和 Cython 的使用,整体计算负荷进一步降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信