A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.
This paper optimizes portfolio compression by reducing excess notional in market contracts.
Paper finds efficient algorithms for computing fixed points in financial networks.
I show that the solution of a standard clearing model commonly used in contagion analyses for financial systems can be expressed as a specific form of a generalized Katz centrality measure under conditions that correspond to a system-wide shock. This result provides a formal explanation for earlier empirical results wh…
This paper provides a framework for modeling the financial system with multiple illiquid assets during a crisis. This work generalizes the paper by Amini, Filipovic and Minca (2016) by allowing for differing liquidation strategies. The main result is a proof of sufficient conditions for the existence of an equilibrium …
We propose a model for the credit and liquidity risks faced by clearing members of Central Counterparty Clearing houses (CCPs). This model aims to capture the features of: gap risk; feedback between clearing member default, market volatility and margining requirements; the different risks faced by various types of mark…
Unified model for network risks, including bilateral and central clearing, with practical applications.
Optimal control solves multi-period liability clearing problems.
Paper introduces Cycles Protocol to integrate trade credit into market clearing.
A new method for clearing liability networks using sheaves on directed hypergraphs.
In this study, we focus on the market clearing problem of Turkish day-ahead electricity market. We propose a mathematical model by extending the variety of bid types for different price regions. The commercial solvers may not find any feasible solution for the proposed problem in some instances within the given time li…
We quantify the sensitivity of the Eisenberg-Noe clearing vector to estimation errors in the bilateral liabilities of a financial system in a stylized setting. The interbank liabilities matrix is a crucial input to the computation of the clearing vector. However, in practice central bankers and regulators must often es…
For linear classifiers, the relationship between (normalized) output margin and generalization is captured in a clear and simple bound -- a large output margin implies good generalization. Unfortunately, for deep models, this relationship is less clear: existing analyses of the output margin give complicated bounds whi…
The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied. In this work, we cast the problem of predicting clearing prices into a learning framework and use the resulting models to perform revenue optimization in auctions and markets with contextual information. T…
Recent innovations in Information and Communication Technologies (ICT) provide new opportunities and challenges for integration of distributed energy resources (DERs) into the energy supply system as active market players. By increasing integration of DERs, novel market platform should be designed for these new market …
The paper examines clearing payments in financial networks to prevent cascaded defaults.
A new model calculates optimal clearing payments in dynamic financial networks.
CLEAR calibrates both aleatoric and epistemic uncertainties for better predictive intervals.
Debt swaps improve financial networks by optimizing clearing payments and stability.
Pari-mutuel markets are trading platforms through which the common market maker simultaneously clears multiple contingent claims markets. This market has several distinctive properties that began attracting the attention of the financial industry in the 2000s. For example, the platform aggregates liquidity from the ind…
Proposes a model for clearing prices in financial markets due to margin calls.
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 …
Deep learning solves complex PA mean field games with market-clearing conditions.
We propose the kl-UCB ++ algorithm for regret minimization in stochastic bandit models with exponential families of distributions. We prove that it is simultaneously asymptotically optimal (in the sense of Lai and Robbins' lower bound) and minimax optimal. This is the first algorithm proved to enjoy these two propertie…
One of the problems on the way to successful implementation of neural networks is the quality of annotation. For instance, different annotators can annotate images in a different way and very often their decisions do not match exactly and in extreme cases are even mutually exclusive which results in noisy annotations a…
Study compares two market clearing methods for European power markets.
Machine learning predicts homicide clearance rates with SHAP explaining key features.
CLEAR learns causal graphs from attention in recommender systems to explain user behavior.
The paper analyzes financial networks with default charges and defines a model using fixpoint problems.
Unified framework for complex financial networks using lattice theory.
Improved hardness results for clearing payments in financial networks with CDSs.
Develops ML tool for macroeconomic forecasting with clear interpretations.
This study assesses model influence on RL algorithm performance.
We propose a new learning to rank algorithm, named Weighted Margin-Rank Batch loss (WMRB), to extend the popular Weighted Approximate-Rank Pairwise loss (WARP). WMRB uses a new rank estimator and an efficient batch training algorithm. The approach allows more accurate item rank approximation and explicit utilization of…
Blockchain markets with paid-priority trading can lead to biased prices and reduced liquidity.
We consider a dynamic market model where buyers and sellers submit limit orders. If at a given moment in time, the buyer is unable to complete his entire order due to the shortage of sell orders at the required limit price, the unmatched part of the order is recorded in the order book. Subsequently these buy unmatched …
The call auction is a widely used trading mechanism, especially during the opening and closing periods of financial markets. In this paper, we study a standard call auction problem where orders are submitted according to Poisson processes, with random prices distributed according to a general distribution, and may be c…
Sequential processing biases asset allocation in artificial stock markets.
We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and feasibility gap. Through theoretical analysis, we show how to update all the al…
Paper analyzes fire sales in a network of banks using VWAP and LOB pricing.
As a fundamental problem of natural language processing, it is important to measure the distance between different documents. Among the existing methods, the Word Mover's Distance (WMD) has shown remarkable success in document semantic matching for its clear physical insight as a parameter-free model. However, WMD is e…
In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the equilibrium price. We compare the two algorithms through experimental analyses, …
Two of the most fundamental prototypes of greedy optimization are the matching pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms. We derive …
This study analyzes costs of CCP default resolution using Radner equilibrium approach.
We derive and analyze a new, efficient, pool-based active learning algorithm for halfspaces, called ALuMA. Most previous algorithms show exponential improvement in the label complexity assuming that the distribution over the instance space is close to uniform. This assumption rarely holds in practical applications. Ins…
Collaborative filtering is a rapidly advancing research area. Every year several new techniques are proposed and yet it is not clear which of the techniques work best and under what conditions. In this paper we conduct a study comparing several collaborative filtering techniques -- both classic and recent state-of-the-…
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 …
MLJ offers a Julia package for composing machine learning models.