Research
On-device research index

arXiv research

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.

169,291 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Mar 199419922001200920182026
48 results for repo agreements

The general and special repo rates are related with the prices of the European call- and American put-options. The evaluation takes into account specific business models of the parties in the repo agreement and the law restrictions. Using the repo-option relation, an alternative to the Black-Scholes method of option pr…

2013-11-20abs ↗pdf ↗

A repurchase agreement lets investors borrow cash to buy securities. Financier only lends to securities' market value after a haircut and charges interest. Repo pricing is characterized with its puzzling dual pricing measures: repo haircut and repo spread. This article develops a repo haircut model by designing haircut…

2016-04-19abs ↗pdf ↗

Leverage is strongly related to liquidity in a market and lack of liquidity is considered a cause and/or consequence of the recent financial crisis. A repurchase agreement is a financial instrument where a security is sold simultaneously with an agreement to buy it back at a later date. Repurchase agreements (repos) ma…

2010-11-01abs ↗pdf ↗

In this note we show how to replicate a stylized CDS with a repurchase agreement and an asset swap. The latter must be designed in such a way that, on default of the issuer, it is terminated with a zero close-out amount. This break clause can be priced using the well known unilateral credit/debit valuation adjustment f…

2013-04-30abs ↗pdf ↗

In this article, we combine replication pricing with expectation pricing for derivative trades that are partially collateralized by cash. The derivatives are replicated by underlying assets and cash, using repurchasing agreement (repo) and margining, which incur funding costs. We derive a partial differential equation …

2013-02-03abs ↗pdf ↗

The paper develops a new discount rate for derivatives using imperfect securities as collateral.

problem Inconsistent and non-observable collateral rates in derivatives markets.
method Synthesizes effects of imperfect collateral into a new discount rate, employs break-even repo formulae, and uses linear programming for optimization.
result Liquidity value adjustment (LVA) can be significant for long-term derivatives portfolios.

The paper addresses XVA valuation under market crises using a renewal process.

problem XVA valuation without considering market crises and illiquidity.
method Using an alternating renewal process, the paper develops a framework to price XVA under a state-dependent financial regime.
result The XVA price is characterized as a solution to a backward stochastic differential equation (BSDE).

We develop a framework for computing the total valuation adjustment (XVA) of a European claim accounting for funding costs, counterparty credit risk, and collateralization. Based on no-arbitrage arguments, we derive backward stochastic differential equations (BSDEs) associated with the replicating portfolios of long an…

2016-08-09abs ↗pdf ↗

The study calculates securities lending haircuts and indemnification costs.

problem Managing borrower default risk in securities markets.
method Repo haircut model applied to securities lending transactions; quantifies haircuts and indemnification costs.
result Computed borrower-dependent haircuts and indemnification costs for US Treasuries and equities.

Solves a 60-year-old question on agreement measures in statistics.

problem The challenge of measuring agreement between two raters or measures.
method Developed a new algorithm to minimize diagonals in contingency tables, formulated the minimum feasible agreement, and studied the lower limit of maximum feasible agreement.
result Formulated the lower limit of Cohen's kappa and two statistics for agreement analysis.

Study how network structure affects collateral dynamics in banking systems.

problem Effects of network structure on collateral volume and hoarding in banking systems.
method Simple model of bank interactions via repo contracts and rehypothecation.
result Network structures with concentrated collateral flows are more exposed to large hoarding cascades.

We take the holistic approach of computing an OTC claim value that incorporates credit and funding liquidity risks and their interplays, instead of forcing individual price adjustments: CVA, DVA, FVA, KVA. The resulting nonlinear mathematical problem features semilinear PDEs and FBSDEs. We show that for the benchmark v…

2016-02-18abs ↗pdf ↗

SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.

problem Improving robustness in computation, especially in high-dimensional settings.
method SNAP assigns weights based on mutual agreement, suppressing outlier contributions.
result SNAP ensures outliers contribute negligibly to computations, even in high-dimensional settings.

Paper tackles zero-shot translation by encouraging consistent agreement in models.

problem Challenges of generalizing multilingual translation without parallel data.
method Reformulated as probabilistic inference, introduced consistent agreement-based training.
result Agreement-based learning improves zero-shot translation by 2-3 BLEU points.

The paper analyzes indices based on counting object pairs for assessing partition agreement in unsupervised learning.

problem The difficulty in interpreting overall indices like Rand and adjusted Rand indices.
method Analysis of three families of indices based on counting object pairs, decomposing overall indices into cluster-level indices.
result Overall indices based on pair-counting approach are sensitive to cluster size imbalance and provide limited information on smaller clusters.

LFD method improves text classification by making features clearer and less label-leaking.

problem Creating interpretable text representations that are both predictive and understandable.
method LFD method: proposes lexical and semantic features from contrastive text pairs, screens candidates using κκ, and selects features by residual gain.
result LFD features achieve higher human-human and human-LLM agreement than baseline concepts and are less label-leaking.

In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, each of which is nearly sufficent in determining the correct labels. In this paper we present a new algorithm for probabilistic multi-view lear…

2012-06-13abs ↗pdf ↗

Model estimates LIBOR rates and finds COVID-19 spread spike due to credit risk.

problem Estimating LIBOR rates and understanding the factors affecting them.
method Developed a joint model for various LIBOR-related rates and used it to decompose spreads.
result Credit risk mainly caused the spike in LIBOR-OIS spread during the COVID-19 onset, with equal contributions from credit and funding-liquidity risks on average.

In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph GG with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard. We present a novel approx…

2016-03-09abs ↗pdf ↗

Algorithm for agents to agree on a single objective in multi-task networks.

problem Decentralized decision-making in multi-task networks with multiple objectives.
method Distributed decision-making algorithm for agents observing different models.
result Agents reach agreement on which model to track for network performance enhancement.

A new method for combining multiple data views in supervised learning.

problem Combining multiple data views in supervised learning, especially in biology and medicine.
method Cooperative learning combines squared error loss with an agreement penalty to encourage predictions from different data views to agree.
result Cooperative learning achieves higher predictive accuracy on simulated and real multiomics data.

The paper proposes a method to trim Bayesian network classifiers robustly.

problem Removing costly features from Bayesian network classifiers while maintaining robustness.
method Introduces an expected classification agreement (ECA) metric and a branch-and-bound search algorithm to find optimal feature subsets and thresholds.
result The proposed method maximizes expected agreement between the original and trimmed classifiers, subject to a budgetary constraint.

AVRA automatically rates brain atrophy from MRI images, achieving high agreement with human radiologists.

problem Manual visual rating of brain atrophy by radiologists is time-consuming and inconsistent.
method AVRA uses machine learning, trained on 2350 ratings, to automatically rate various atrophy scales.
result AVRA achieves substantial agreement with human radiologists, with Cohen's weighted kappa values of 0.74-0.74.

We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…

2005-08-12abs ↗pdf ↗

Study finds simple model-agreement scores perform well in various error estimation scenarios.

problem Evaluating model performance on unseen distributions using disparate scoring functions.
method Rigorously studied popular scoring functions (confidence, local manifold smoothness, model agreement) independently of mechanism choice.
result Simple model-agreement scores outperform confidence- and smoothness-based scores in realistic settings with compromised training data.

Researchers develop multi-agent systems for quadcopters to collaborate in missions.

problem Enable multiple quadcopters to work together in remote sensing tasks.
method Agent dynamics, network topologies, collective behaviors, agreement protocol, equations of motion for quadcopters.
result Multi-agent systems can successfully collaborate in remote sensing missions.

Study shows more data improves model explanations, aiding reliable knowledge extraction.

problem Challenges in deriving reliable knowledge from machine learning models due to the Rashōmon effect.
method Examined the influence of sample size on explanations from models in a Rashōmon set using SHAP.
result Explanations from <128 samples are highly variable, but agreement improves with more data.

MAS scores cluster size consistency from points, robust to label changes.

problem Desired uniformity in cluster sizes, stability under label perturbations.
method Mass Agreement Score (MAS) measures point-centric cluster size consistency, robust to label changes.
result MAS yields similar scores for partitions with similar bulk structure, sensitive to genuine redistribution of cluster mass.