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 …
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,932 papers · 148 categories
Trend · papers per month
48 results for “accelerated share repurchase”
Paper proposes machine learning for managing complex buyback contracts.
problem Managing complex buyback contracts, especially accelerated share repurchase.
method Proposes a machine learning method to optimally manage buyback contracts.
result Recovery of strategies similar to those obtained with partial differential equations and tree methods, but without the curse of dimensionality.
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…
The paper examines how share buybacks impact a company's earnings per share.
problem The trade-off between reducing share count and decreasing net earnings due to share buybacks.
method Review of accretive share repurchases, analysis of EPS increase as a function of price paid, and quantification of earnings growth difference.
result Share buybacks can enhance EPS, but the net effect on earnings growth is mixed.
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.
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.
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.
Foundations for Wash Salesq-fin.MF
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 calendar days. Since a portfolio is essentially the same after a wash sale, any tax advantage from …
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.
Model explains money creation under regulatory constraints.
problem Understanding money creation dynamics under regulatory pressures.
method Agent-based model of secured interbank network.
result Excess liquidity and repurchase agreements emerge due to regulatory constraints.
BONAS accelerates NAS while maintaining reliability.
problem Computational inefficiency in sample-based NAS.
method Bayesian Optimized Neural Architecture Search (BONAS) using weight-sharing.
result BONAS accelerates sample-based NAS significantly while maintaining reliability.
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.
Weight-sharing is rarely helpful in NAS, especially on small datasets.
problem The efficiency of weight-sharing in Neural Architecture Search (NAS) is questionable.
method Comparison of a state-of-the-art weight-sharing approach to random search on the nasbench dataset.
result Weight-sharing is only rarely significantly helpful in NAS, highlighting the importance of the search space.
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…
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
Accelerates policy optimization in RL with optimistic and adaptive updates.
problem Improving policy optimization methods in reinforcement learning.
method Integrates foresight into policy improvement step via optimistic and adaptive updates.
result Designs an optimistic policy gradient algorithm, adaptive via meta-gradient learning.
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…
NFT Wash Trading Detectionq-fin.GN
AnChain.AI detects NFT wash trading with 0.14% of transactions flagged.
problem NFT market manipulation through wash trading.
method Algorithm flags transactions within 30 days of repurchase.
result 0.14% of NFT transactions are involved in wash trading.
Leverage Bubbleq-fin.GN
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…
Paper accelerates diffusion models, improving sampling speed.
problem Low sampling speed in score-based diffusion models.
method Design of novel training-free algorithms for deterministic and stochastic samplers.
result Accelerated samplers converge faster with improved rates.
New method FedEx accelerates federated hyperparameter tuning.
problem Federated hyperparameter tuning challenges in distributed learning.
method FedEx method connecting to weight-sharing, adapted for federated optimization.
result FedEx outperforms natural baselines on various benchmarks.
In recent years, convolutional neural networks (CNNs) have shown great performance in various fields such as image classification, pattern recognition, and multi-media compression. Two of the feature properties, local connectivity and weight sharing, can reduce the number of parameters and increase processing speed dur…
PIMA autoencoders discover shared features in multimodal scientific data.
problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.
The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the architecture community, the lion share of effort has targeted CNN inference for image recognition. The closely related problem of video recognition…
Paper tackles ride-sharing user experience enhancement with weakly supervised learning.
problem Compound weakly supervised learning problem in ride-sharing comment data.
method CWSL method with instance reweighting, robust criteria, and alternating optimization.
result Effectiveness validated on Didi ride-sharing comment data.
On-device CNN inference for real-time computer vision applications can result in computational demands that far exceed the energy budgets of mobile devices. This paper proposes FixyNN, a co-designed hardware accelerator platform which splits a CNN model into two parts: a set of layers that are fixed in the hardware pla…
Corrects technical error in change of measure for HTB models.
problem Technical error in change of measure for HTB models.
method Provided supplement conditions to correct the error.
result Corrected technical error in change of measure for HTB models.
New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.
problem Rational actors will deploy AGI despite negative social value due to shared catastrophic risk.
method Continuous-time preemption game with shared catastrophic externalities, showing suicide region and welfare distortion.
result The suicide region widens as catastrophic risk grows, and two mechanisms can close it.
Accelerates Birkhoff projection for manifold-constrained hyper-connections with high accuracy and speed.
problem Inaccurate and slow Birkhoff projection in mHC implementations.
method Dual formulation, Newton's method, implicit differentiation, warp-level CUDA kernel.
result Substantial speedups and accuracy improvements in doubly stochastic projections.
Efficient actor-critic learning with shared experience replay improves data efficiency.
problem Challenges in actor-critic reinforcement learning with experience replay and off-policy learning stability.
method Combining actor-critic algorithms with shared experience replay, analyzing V-trace, proposing a trust region scheme.
result State-of-the-art data efficiency on Atari achieved with 200M environment frames.
This dissertation advances the theoretical foundation of local optimization methods in Federated Learning.
problem Theoretical understanding of local optimization methods in Federated Learning is lacking.
method The dissertation proposes and analyzes new methods to improve convergence rates and communication efficiency in Federated Learning.
result Sharp bounds and convergence rates for FedAvg are established, and new methods like FedAc and Federated Dual Averaging are proposed.
Paper shows how sparse inversion speeds up log determinant derivatives.
problem Deriving log determinant derivatives for sparse matrices.
method Sparse inversion, selected inversion, accelerates computation.
result Derivative of log determinant can be computed faster with sparse inversion.
Time-resolved angiography with interleaved stochastic trajectories (TWIST) has been widely used for dynamic contrast enhanced MRI (DCE-MRI). To achieve highly accelerated acquisitions, TWIST combines the periphery of the k-space data from several adjacent frames to reconstruct one temporal frame. However, this view-sha…
A CNN-based model improves stock price prediction accuracy.
problem Overfitting in image-based stock prediction models.
method SMSFR-CNN combining CNN and image features.
result SMSFR-CNN achieves high predictive accuracy on A-share stocks.
ALF reduces network parameters and operations by 70% and 61%, respectively, on embedded hardware.
problem Efficient deployment of deep learning models on resource-constrained hardware.
method Autoencoder-based low-rank filter-sharing technique.
result ALF achieves significant compression with minimal accuracy loss.
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 …
Dropout is a simple but efficient regularization technique for achieving better generalization of deep neural networks (DNNs); hence it is widely used in tasks based on DNNs. During training, dropout randomly discards a portion of the neurons to avoid overfitting. This paper presents an enhanced dropout technique, whic…
We present a novel method of compression of deep Convolutional Neural Networks (CNNs) by weight sharing through a new representation of convolutional filters. The proposed method reduces the number of parameters of each convolutional layer by learning a 1D vector termed Filter Summary (FS). The convolutional filters ar…
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.
Efficient FPGA virtualization for deep learning reduces user isolation and overhead.
problem Poor isolation and heavy re-compilation overhead in FPGA-based DNN accelerators.
method Two-level instruction dispatch module, multi-core hardware resources pool, tiling-based instruction frame package, two-stage static-dynamic compilation.
result 1.07-1.69x and 1.88-3.12x throughput improvement over previous designs.
Mode Normalizationcs.LG
Normalization methods are a central building block in the deep learning toolbox. They accelerate and stabilize training, while decreasing the dependence on manually tuned learning rate schedules. When learning from multi-modal distributions, the effectiveness of batch normalization (BN), arguably the most prominent nor…
This paper optimizes object tracking on edge devices with small matrices.
problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.
KineticSim accelerates financial market simulations 3406x over CPU.
problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.
This paper uses graph convolutional networks to improve the accuracy of neural architecture search.
problem Improving the precision of sampled sub-networks in weight-sharing NAS.
method Training a graph convolutional network to fit the performance of sampled sub-networks.
result Achieved higher rank correlation coefficient and better final architecture performance.
Unified analysis of Federated Averaging and Nesterov FedAvg for linear speedup.
problem Understanding convergence of FL algorithms under non-i.i.d. data and partial participation.
method Systematic study of convergence guarantees for FedAvg and Nesterov FedAvg under different conditions.
result Unified analysis of linear speedup for FedAvg and Nesterov FedAvg in various settings.
Paper proposes an algorithm for lifelong learning with shared structure.
problem Lifelong learning with shared structure in an online setting.
method Proposes a simple algorithm using multi-task empirical risk minimization.
result Establishes a sample complexity bound based on task-eluder dimension.
AriaNN enables private deep learning with minimal interaction and reduced key sizes.
problem Private deep learning with minimal interaction and reduced key sizes.
method Semi-honest 2-party computation protocol with function secret sharing, optimized primitives for neural network operations.
result Efficient private comparison for ReLU operations with reduced key size and improved performance.
Gap Risk KVA and Repo Pricing: An Economic Capital Approach in the Black-Scholes-Merton Frameworkq-fin.PR
Although not a formal pricing consideration, gap risk or hedging errors are the norm of derivatives businesses. Starting with the gap risk during a margin period of risk of a repurchase agreement (repo), this article extends the Black-Scholes-Merton option pricing framework by introducing a reserve capital approach to …