arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.01883cs.LGcs.DSecon.EMq-fin.CP
收藏

场外信用违约互换市场的竞争分析

Competition analysis on the over-the-counter credit default swap market

Louis Abraham

摘要:

我们研究了两个问题,有关竞争的OTC CDS市场使用的数据收集的EMIR法规的一部分。首先,我们通过抵押品要求来研究中央对手方之间的竞争。我们提出的模型,成功地估计初始保证金要求。然而,我们的估计不够精确,无法将其用作OTC市场交易对手选择CCP的预测模型的输入。第二,我们使用一种新的半监督预测任务在交易商间市场上对对手选择进行建模。我们提出了我们的方法,作为文献的一部分,模型的可解释性,然后再争论使用条件熵作为度量的兴趣,通过模型不可知的方法从数据中获取知识。特别是,我们证明了使用深度神经网络来测量现实世界数据集的条件熵。我们使用算法信息论的框架创建了$\textit{Razor entropy}$,并导出了与我们的半监督训练目标相同的显式公式。最后,我们借用博弈论中的概念来定义$\textit{top-k Shapley values}$。这种新的支付分配方法满足Shapley值的大部分性质,并且当价值函数是单调子模时特别有趣。与经典Shapley值不同,top-k Shapley值可以在特征数量的二次时间而不是指数时间内计算。我们实施我们的方法,并报告我们的特定任务的结果的对应选择。最后,我们提出了一个改进的$\textit{node2vec}$算法,例如可以用于进一步研究中介。我们表明,在有偏行走的生成中使用的邻居采样可以在对数时间内进行准线性时间预计算,不像目前的实现,不扩展。

英文摘要:

We study two questions related to competition on the OTC CDS market using data collected as part of the EMIR regulation. First, we study the competition between central counterparties through collateral requirements. We present models that successfully estimate the initial margin requirements. However, our estimations are not precise enough to use them as input to a predictive model for CCP choice by counterparties in the OTC market. Second, we model counterpart choice on the interdealer market using a novel semi-supervised predictive task. We present our methodology as part of the literature on model interpretability before arguing for the use of conditional entropy as the metric of interest to derive knowledge from data through a model-agnostic approach. In particular, we justify the use of deep neural networks to measure conditional entropy on real-world datasets. We create the $\textit{Razor entropy}$ using the framework of algorithmic information theory and derive an explicit formula that is identical to our semi-supervised training objective. Finally, we borrow concepts from game theory to define $\textit{top-k Shapley values}$. This novel method of payoff distribution satisfies most of the properties of Shapley values, and is of particular interest when the value function is monotone submodular. Unlike classical Shapley values, top-k Shapley values can be computed in quadratic time of the number of features instead of exponential. We implement our methodology and report the results on our particular task of counterpart choice. Finally, we present an improvement to the $\textit{node2vec}$ algorithm that could for example be used to further study intermediation. We show that the neighbor sampling used in the generation of biased walks can be performed in logarithmic time with a quasilinear time pre-computation, unlike the current implementations that do not scale well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑