Model assesses risks in CCP networks, identifying wrong-way risks.
problem Credit and liquidity risks in CCP networks.
method Developed a model to capture features of gap risk, feedback, and different participant risks.
result Identified wrong-way risks between clearing member defaults and market turbulence.
Central Counterparties (CCPs) are widely promoted as a requirement for safe banking with little dissent except on technical grounds (such as proliferation of CCPs). Whilst CCPs can have major operational positives, we argue that CCPs have many of the business characteristics of Rating Agencies, and face similar busines…
A clearing member of a Central Counterparty (CCP) is exposed to losses on their default fund and initial margin contributions. Such losses can be incurred whenever the CCP has insufficient funds to unwind the portfolio of a defaulting clearing member. This does not necessarily require the default of the CCP itself. In …
This study analyzes costs of CCP default resolution using Radner equilibrium approach.
problem Analyzing costs of CCP default resolution for investment banks' derivatives.
method Radner equilibrium approach for portfolio allocation and price discovery.
result Radner equilibria uniquely exist and provide solutions for market equilibria.
CCP clusters correlated features and projects them to 1D for efficient dimensionality reduction.
problem Efficiency in handling large datasets with high intrinsic dimensions.
method CCP partitions features into correlated clusters and projects them to 1D based on sample correlations.
result CCP achieves efficient dimensionality reduction without matrix diagonalization.
Two new methods score stress test scenarios for risk managers.
problem Comparing and evaluating stress test scenarios for risk managers.
method Inspired by Archer-Mouy-Selmi, two methodologies for scoring stress test scenarios.
result New methods can compare and evaluate stress test scenarios.
The introduction of CCPs in most derivative transactions will dramatically change the landscape of derivatives pricing, hedging and risk management, and, according to the TABB group, will lead to an overall liquidity impact about 2 USD trillions. In this article we develop for the first time a comprehensive approach fo…
Pakistan examines digital mergers using traditional competition tools.
problem Regulating digital mergers in a developing country.
method Empirical comparative analysis of CCP's M&A decisions.
result CCP uses same decision factors for digital and traditional M&As.
We study the impact of central clearing of over-the-counter (OTC) transactions on counterparty exposures in a market with OTC transactions across several asset classes with heterogeneous characteristics. The impact of introducing a central counterparty (CCP) on expected interdealer exposure is determined by the tradeof…
Paper introduces Cycles Protocol to integrate trade credit into market clearing.
problem Liquidity embedded in trade credit outside formal settlement infrastructures.
method Distributed, multilateral clearing mechanism based on double-entry accounting.
result Cycles Protocol maximizes balance sheet compression without redistributing counterparty risk.
CCPs, Central Clearing, CSA, Credit Collateral and Funding Costs Valuation FAQ: Re-hypothecation, CVA, Closeout, Netting, WWR, Gap-Risk, Initial and Variation Margins, Multiple Discount Curves, FVA?q-fin.PR We present a dialogue on Funding Costs and Counterparty Credit Risk modeling, inclusive of collateral, wrong way risk, gap risk and possible Central Clearing implementation through CCPs. This framework is important following the fact that derivatives valuation and risk analysis has moved from exotic derivatives managed…
Dynamic model assesses CCP risk with time-consistent risk measures.
problem Assessing central counterparty risk in dynamic markets.
method Markovian structure model of joint credit migrations; time-consistent dynamic risk measures.
result Proposes a method for more accurate initial margin and default fund allocation.
New systemic risk models for banks choosing their group memberships.
problem Analyzing systemic risk for banks in disjoint and overlapping groups.
method Proposed new models with realistic game features, introducing Nash equilibrium for optimal solution.
result Explicit solution for risk allocation and existence/uniqueness of Nash equilibrium.
Paper introduces ℓ-DER for regression tasks using morphological operators and convex-concave procedure.
problem Developing a universal approximator for regression tasks.
method Introduces ℓ-DER model, trains it using a convex-concave procedure (CCP) to minimize least-squares. result Outperforms other hybrid morphological models and state-of-the-art approaches.
The paper develops a new model-free formula for option initial margins.
problem Calculating initial margins for option portfolios is complex and risky.
method The authors derive a new approximation formula for VaR without assuming a model.
result The new formula performs better than existing methods in simulations.
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) a…
Bank behavior affects XVA pricing by influencing counterparty independence assumptions.
problem XVA pricing assumes counterparty independence, but bank behavior complicates this assumption.
method Developed a theoretical framework considering bank behavior and anonymous counterparties.
result Bank behavior requires inclusion of multiple CVA costs and affects KVA and FVA.
Study competition in OTC CDS market through CCP and interdealer choice models.
problem Analyze competition dynamics in OTC credit default swap market.
method Developed models for CCP choice and interdealer counterpart selection using semi-supervised learning and game theory.
result Introduced novel metrics and algorithms for understanding market dynamics.
An uncollateralized swap hedged back-to-back by a CCP swap is used to introduce FVA. The open IR01 of FVA, however, is a sure sign of risk not being fully hedged, a theoretical no-arbitrage pricing concern, and a bait to lure market risk capital, a practical business concern. By dynamically trading the CCP swap, with t…
The market practice of extrapolating different term structures from different instruments lacks a rigorous justification in terms of cash flows structure and market observables. In this paper, we integrate our previous consistent theory for pricing under credit, collateral and funding risks into term structure modellin…
This paper develops an XVA (costs) analysis of centrally cleared trading, parallel to the one that has been developed in the last years for bilateral transactions. We introduce a dynamic framework that incorporates the sequence of cash-flows involved in the waterfall of resources of a clearing house. The total cost of …
We introduce an innovative theoretical framework to model derivative transactions between defaultable entities based on the principle of arbitrage freedom. Our framework extends the traditional formulations based on Credit and Debit Valuation Adjustments (CVA and DVA). Depending on how the default contingency is accoun…
Generative model uses random weighted support points for interpretable data sampling.
problem Creating diverse and interpretable sample sets from large datasets efficiently.
method Random weighted support points from Dirichlet process and Bayesian bootstrap.
result High-quality and diverse outputs at lower computational cost.
New MKABSDEs help calculate initial margins in financial contracts.
problem Calculating initial margins in financial contracts with dependencies.
method Introduced MKABSDEs, provided existence and uniqueness, applied to CVaR, used deterministic and Monte-Carlo methods for numerical approximations.
result MKABSDEs provide a new way to solve for initial margins in financial contracts.
The ongoing concern about systemic risk since the outburst of the global financial crisis has highlighted the need for risk measures at the level of sets of interconnected financial components, such as portfolios, institutions or members of clearing houses. The two main issues in systemic risk measurement are the compu…
A scalable method for deep metric learning using chance constraints.
problem Improving deep metric learning by addressing feasibility issues.
method Relating DML to chance constraints, reformulating as a feasibility problem, and iteratively training proxies.
result The method effectively improves deep metric learning performance across multiple benchmarks.
New method converts p-values to e-values for more efficient CP and aggregation.
problem Limitations of existing p-to-e calibrators in CP setting.
method Proposes a novel P2E calibrator for set-preserving calibration.
result Significant efficiency gains over existing p-to-e calibrators.
We develop an arbitrage-free framework for consistent valuation of derivative trades with collateralization, counterparty credit gap risk, and funding costs, following the approach first proposed by Pallavicini and co-authors in 2011. Based on the risk-neutral pricing principle, we derive a general pricing equation whe…
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
New model reconstructs networks by identifying regular components.
problem Uncovering the complexity of network structures.
method Low-rank pursuit based self-representation network model.
result Reconstructs networks and measures their regulability.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
Study 986 diverse networks to reveal structural diversity across domains.
problem Understanding structural diversity in networks across various domains.
method Machine learning techniques (random forest, confusion matrix) on 986 real-world networks and 575 generated networks.
result Networks in the same partition have similar underlying functions, constraints, and generative mechanisms, regardless of their origins.
Network recasting transforms network architecture for faster inference.
problem Accelerate inference process through network transformation.
method Block-wise recasting of source blocks in a teacher network to target blocks in a student network.
result Transforms network architecture while preserving accuracy and reducing inference time.
Highly accurate classification of network categories achieved.
problem Distinguishing between different types of networks (e.g., social vs. web graphs).
method Used a random forest classifier on both real-world and synthetic networks.
result Achieved a 94.2% classification accuracy.
Network Lens identifies node behaviors in heterogeneous networks with high accuracy.
problem Identifying different behaviors in various parts of large heterogeneous networks.
method Zoom into network using different-sized lenses to capture local structure, weight signatures to predict node labels.
result Achieved a peak accuracy of ~42% on two networks with ~100,000 and ~1,000,000 nodes, significantly better than random.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Paper proposes algorithms for embedding directed networks with text associated nodes.
problem Learning embeddings for directed networks with text associated nodes.
method PCTADW-1 and PCTADW-2 neural network algorithms.
result Embeddings improve node classification quality on software package dependency networks.
Evolutionary synthesis of deep neural networks improves efficiency and performance.
problem Creating highly efficient deep neural networks.
method Evolutionary process using synaptic probability models and random mutation.
result Synthesized networks achieve state-of-the-art performance with 48-fold fewer synapses.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
New method identifies common organizational principles in networks.
problem Challenging to cluster networks of different size and density.
method Introduces a new network comparison methodology.
result Identifies common organizational principles in networks.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.