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,694 papers · 148 categories

Trend · papers per month

491317 · May 202619922001200920172026
48 results for repurchase agreements

Study confirms eurozone interbank market stability but finds higher collateral reuse.

problem Analyzing eurozone interbank market behavior and stability.
method Examined secured transactions data from ECB, tested stylized facts, measured network properties.
result Observed higher collateral reuse and network symmetry compared to unsecured markets.

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 ↗

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 ↗

Paper proposes deep learning model for dynamic stock repurchase forecasting.

problem Complex temporal dependencies in corporate financial conditions.
method Hybrid Temporal Convolutional Network (TCN) and Attention-based LSTM.
result Model significantly outperforms static baselines in stock repurchase forecasting.

This paper aims to explore the mechanical effect of a company's share repurchase on earnings per share (EPS). In particular, while a share repurchase scheme will reduce the overall number of shares, suggesting that the EPS may increase, clearly the expenditure will reduce the net earnings of a company, introducing a tr…

2019-11-11abs ↗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 ↗

In this article, we consider the optimal execution problem associated to accelerated share repurchase contracts. When firms want to repurchase their own shares, they often enter such a contract with a bank. The bank buys the shares for the firm and is paid the average market price over the execution period, the length …

2013-12-19abs ↗pdf ↗

Developed policy gradient methods for stochastic control with exit time, outperforming traditional techniques in share repurchase pricing.

problem Optimal control with exit time in stochastic models.
method Two types of algorithms: direct policy learning and alternately learning value function and control.
result Policy gradient methods outperform PDE or neural networks in share repurchase pricing.

A dynamic model of the product lifecycle of (nearly) homogeneous durables in polypoly markets is established. It describes the concurrent evolution of the unit sales and price of durable goods. The theory is based on the idea that the sales dynamics is determined by a meeting process of demanded with supplied product u…

2011-09-05abs ↗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 ↗

Develops a machine-learning framework for optimal share repurchase hedging.

problem Challenges in hedging share repurchase programs due to market regulations and trading activity.
method Machine-learning framework that optimizes execution and hedging of share repurchase programs.
result Substantial performance improvements and an optimized hedging approach.

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

Extends pricing theory for collateralized derivatives to include jumps and dividends.

problem Pricing collateralized derivatives with jumps and dividends.
method Extends No-Arbitrage theory to semimartingales, deriving pricing, dynamics, and forward prices.
result Derives pricing, dynamics, and forward prices of collateralized derivatives.

Consider an ephemeral sale-and-repurchase of a security resulting in the same position before the sale and after the repurchase. A sale-and-repurchase is a wash sale if these transactions result in a loss within ±30\pm 30 calendar days. Since a portfolio is essentially the same after a wash sale, any tax advantage from …

2015-11-11abs ↗pdf ↗

Be it for taking advantage of stock undervaluation or in order to distribute part of their profits to shareholders, firms may buy back their own shares. One of the way they proceed is by including Accelerated Share Repurchases (ASR) as part of their repurchase programs. In this article, we study the pricing and optimal…

2014-10-06abs ↗pdf ↗

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.

As the Securities and Exchange Commission(SEC) has implemented a new regulation on short-sellings, short-sellers are required to repurchase stocks once the clearing risk rises to a certain level. Avellaneda and Lipkin proposed a fully coupled SDE system to describe the mechanism which is referred as Hard-To-Borrow(HTB)…

2020-01-28abs ↗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.

New method optimizes share buyback contracts without optimal control's limitations.

problem High-dimensional state spaces and risk penalty selection issues in traditional methods.
method Applies optimized heuristic strategies and classical pricing methods.
result Maximizes contract value and disentangles repurchase from hedging.

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.

Study upper hedging prices for contingent claims in models with various types of arbitrage.

problem Valuation of contingent claims in market models with different types of arbitrage.
method Analysis of market models with increasing profit, strong arbitrage, and arbitrage of the first kind.
result Option prices are reduced when increasing profit is present, and corporate stock price processes can be derived from issuance and repurchase plans.

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 ↗

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 ↗

Model selection is a problem that has occupied machine learning researchers for a long time. Recently, its importance has become evident through applications in deep learning. We propose an agreement-based learning framework that prevents many of the pitfalls associated with model selection. It relies on coupling the t…

2018-06-04abs ↗pdf ↗

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.

Generalization and reliability of multilingual translation often highly depend on the amount of available parallel data for each language pair of interest. In this paper, we focus on zero-shot generalization---a challenging setup that tests models on translation directions they have not been optimized for at training t…

2019-04-04abs ↗pdf ↗

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.

The adjusted Rand index (ARI) is commonly used in cluster analysis to measure the degree of agreement between two data partitions. Since its introduction, exploring the situations of extreme agreement and disagreement under different circumstances has been a subject of interest, in order to achieve a better understandi…

2020-02-10abs ↗pdf ↗

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.

In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose a distributed decision-making algorithm. The agents are assumed …

2018-12-20abs ↗pdf ↗