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.

168,742 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for repo curves

There is an observed basis between repo discounting, implied from market repo rates, and bond discounting, stripped from the market prices of the underlying bonds. Here, this basis is explained as a convexity effect arising from the decorrelation between the discount rates for derivatives and bonds. Using a Hull-White …

2019-05-08abs ↗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 ↗

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 ↗

Cash collateral is perfect in that it provides simultaneous counterparty credit risk protection and derivatives funding. Securities are imperfect collateral, because of collateral segregation or differences in CSA haircuts and repo haircuts. Moreover, the collateral rate term structure is not observable in the repo mar…

2017-02-14abs ↗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 ↗

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.

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 ↗

This work develops an agent-based model for the study of how the leverage through the use of repurchase agreements can function as a mechanism for the propagation and amplification of financial shocks in a financial system. Based on the analysis of financial intermediaries in the repo and interbank lending markets duri…

2017-03-22abs ↗pdf ↗

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 ↗

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 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 ↗

We discuss the binary nature of funding impact in derivative valuation. Under some conditions, funding is either a cost or a benefit, i.e., one of the lending/borrowing rates does not play a role in pricing derivatives. When derivatives are priced, considering different lending/borrowing rates leads to semi-linear BSDE…

2017-03-01abs ↗pdf ↗

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).

The paper explains the fair basis in bond-CDS trading during financial crises.

problem Large basis trading losses during financial crises are not explained by reduced form models.
method Dynamic spread model with bond repo financing, economic capital approach.
result Unhedged and unhedgeable residual jump to default risk exists, affecting fair basis level.

TradeMech nets trades without changing counterparty relationships.

problem Netting trades without altering counterparty exposure in complex financial networks.
method Transforms contracts into chains and cycles, nets designated object multilaterally, and replaces contracts with new multiparty agreements.
result Maximal multilateral netting of a designated object while preserving each agent's profit and counterparty risk.

Tree-Query uses LLMs to discover causal relationships in a transparent, interpretable manner.

problem Error propagation in classical causal discovery methods and opaque, confidence-free behavior of recent LLM-based causal oracles.
method Tree-Query is a tree-structured, multi-expert LLM framework that reduces causal discovery to queries about backdoor paths and dependencies.
result Tree-Query provides interpretable judgments with robustness-aware confidence scores and improves structural metrics over LLM baselines.

Improved robustness for deep neural networks with tighter bounds and attacks.

problem Loose upper bounds and prohibitive computation in existing adversarial robustness methods.
method Primal approach with exact Lipschitz certificates for ReLU networks and modern architectures, and novel Wasserstein Distributional Attacks.
result Tighter upper bounds and greater flexibility in attack points compared to existing methods.

SAGE generates subsurface velocity models from sparse well logs and seismic images.

problem Lack of high-quality subsurface velocity models due to limited data availability.
method Subsurface AI-driven geostatistical extraction using proxy posterior.
result SAGE produces geologically plausible and statistically accurate velocity realizations.

End-to-end autonomous driving perception learns latent features for better performance.

problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.

PatchGT uses non-trainable graph patches to improve graph representation learning.

problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.

Neural network for subgraph similarity computation with pruning.

problem Computing subgraph similarity between a target and query graph.
method Convert pruning to node relabeling, relax to differentiable problem, design neural network for SED computation.
result Establishes new state-of-the-art results across multiple benchmark datasets.

LeJEPA provides a scalable, theory-driven approach to self-supervised learning.

problem Lack of practical guidance and theory in JEPAs.
method Identified optimal Gaussian distribution and introduced SIGReg objective.
result LeJEPA achieves state-of-the-art performance with minimal hyperparameters and heuristics.

Paper quantifies uncertainties in EIS spectra of SOFCs, proposing VB method for online monitoring.

problem Distortions in EIS spectra due to disturbances, drifts, and sensor noise.
method Proposes variational Bayes (VB) method for quantifying spectral uncertainty in EIS of SOFCs.
result VB method provides approximate distributions of ECM parameters with low computational load.

Active-GRPO improves molecular optimization by actively deciding when to imitate or self-improve.

problem Training robust and efficient molecular optimization models with large language models.
method Active-GRPO combines imitation and reinforcement learning, upgrading references and policies dynamically.
result Improves molecular optimization performance, achieving statistically significant gains.

The study explores Bertrand and Mannheim curves in 4D Euclidean space for framed curves.

problem Exploring Bertrand and Mannheim curves in 4D Euclidean space for framed curves.
method Defining and investigating Bertrand and Mannheim curves of framed curves in 4D Euclidean space.
result Bertrand and Mannheim curves exist even for framed curves in 4D Euclidean space, contrary to regular curves.

The study examines Bertrand Legendre curves in the unit tangent bundle over Euclidean plane.

problem Investigating properties of Legendre curves and their associated curves.
method Analyzing Bertrand Legendre curves and their associated curves, including parallel, evolute, and involute curves.
result Existence conditions and inverse operation for Bertrand Legendre curves are provided.

In this study, we introduce a new approach to curve pairs by using integral curves. We consider the direction curve and donor curve to study curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves. We obtain new methods to construct partner curves of a unit speed curve and giv…

2017-01-09abs ↗pdf ↗

The paper characterizes curves in pseudo-Galilean 4-space.

problem Characterizing curves in the pseudo-Galilean 4-space G14G_{1}^{4}.
method Investigation and characterisation of admissible curves in terms of curvature functions.
result Necessary and sufficient conditions for admissible rectifying curves in G14G_{1}^{4}.

In this paper, we introduce a new approach to non-lightlike curve pairs by using integral curves in Minkowski 3-space. We consider direction curve and donor curve to study non-lightlike curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves. We obtain new methods to construct…

2017-03-28abs ↗pdf ↗

The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.

problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying kk-equivalent curves, analyzing intersections with other curves.
result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.

Flow deforms locally convex curves to curves of constant k-order width.

problem Evolve locally convex curves to curves of constant k-order width.
method Introduced a nonlocal curvature flow to evolve locally convex curves in the plane.
result The flow converges to a smooth, locally convex curve of constant k-order width as time goes to infinity.