false

Intraday order transition dynamics in high, medium, and low market cap stocks: A Markov chain approach

Intraday order transition dynamics in high, medium, and low market cap stocks: A Markov chain approach ArXiv ID: 2502.07625 “View on arXiv” Authors: Unknown Abstract An empirical stochastic analysis of high-frequency, tick-by-tick order data of NASDAQ100 listed stocks is conducted using a first-order discrete-time Markov chain model to explore intraday order transition dynamics. This analysis focuses on three market cap categories: High, Medium, and Low. Time-homogeneous transition probability matrices are estimated and compared across time-zones and market cap categories, and we found that limit orders exhibit higher degree of inertia (DoI), i.e., the probability of placing consecutive limit order is higher, during the opening hour. However, in the subsequent hour, the DoI of limit order decreases, while that of market order increases. Limit order adjustments via additions and deletions of limit orders increases significantly after the opening hour. All the order transitions then stabilize during mid-hours. As the closing hour approaches, consecutive order executions surge, with decreased placement of buy and sell limit orders following sell and buy executions, respectively. In terms of the differences in order transitions between stocks of different market cap, DoI of orders is stronger in high and medium market cap stocks. On the other hand, lower market cap stocks show a higher probability of limit order modifications and greater likelihood of submitting sell/buy limit orders after buy/sell executions. Further, order transitions are clustered across all stocks, except during opening and closing hours. The findings of this study may be useful in understanding intraday order placement dynamics across stocks of varying market cap, thus aiding market participants in making informed order placements at different times of trading hour. ...

February 11, 2025 · 3 min · Research Team

Minimal Shortfall Strategies for Liquidation of a Basket of Stocks using Reinforcement Learning

Minimal Shortfall Strategies for Liquidation of a Basket of Stocks using Reinforcement Learning ArXiv ID: 2502.07868 “View on arXiv” Authors: Unknown Abstract This paper studies the ubiquitous problem of liquidating large quantities of highly correlated stocks, a task frequently encountered by institutional investors and proprietary trading firms. Traditional methods in this setting suffer from the curse of dimensionality, making them impractical for high-dimensional problems. In this work, we propose a novel method based on stochastic optimal control to optimally tackle this complex multidimensional problem. The proposed method minimizes the overall execution shortfall of highly correlated stocks using a reinforcement learning approach. We rigorously establish the convergence of our optimal trading strategy and present an implementation of our algorithm using intra-day market data. ...

February 11, 2025 · 2 min · Research Team

A nested MLMC framework for efficient simulations on FPGAs

A nested MLMC framework for efficient simulations on FPGAs ArXiv ID: 2502.07123 “View on arXiv” Authors: Unknown Abstract Multilevel Monte Carlo (MLMC) reduces the total computational cost of financial option pricing by combining SDE approximations with multiple resolutions. This paper explores a further avenue for reducing cost and improving power efficiency through the use of low precision calculations on configurable hardware devices such as Field-Programmable Gate Arrays (FPGAs). We propose a new framework that exploits approximate random variables and fixed-point operations with optimised precision to generate most SDE paths with a lower cost and reduce the overall cost of the MLMC framework. We first discuss several methods for the cheap generation of approximate random Normal increments. To set the bit-width of variables in the path generation we then propose a rounding error model and optimise the precision of all variables on each MLMC level. With these key improvements, our proposed framework offers higher computational savings than the existing mixed-precision MLMC frameworks. ...

February 10, 2025 · 2 min · Research Team

TWICE: What Advantages Can Low-Resource Domain-Specific Embedding Model Bring? -- A Case Study on Korea Financial Texts

TWICE: What Advantages Can Low-Resource Domain-Specific Embedding Model Bring? – A Case Study on Korea Financial Texts ArXiv ID: 2502.07131 “View on arXiv” Authors: Unknown Abstract Domain specificity of embedding models is critical for effective performance. However, existing benchmarks, such as FinMTEB, are primarily designed for high-resource languages, leaving low-resource settings, such as Korean, under-explored. Directly translating established English benchmarks often fails to capture the linguistic and cultural nuances present in low-resource domains. In this paper, titled TWICE: What Advantages Can Low-Resource Domain-Specific Embedding Models Bring? A Case Study on Korea Financial Texts, we introduce KorFinMTEB, a novel benchmark for the Korean financial domain, specifically tailored to reflect its unique cultural characteristics in low-resource languages. Our experimental results reveal that while the models perform robustly on a translated version of FinMTEB, their performance on KorFinMTEB uncovers subtle yet critical discrepancies, especially in tasks requiring deeper semantic understanding, that underscore the limitations of direct translation. This discrepancy highlights the necessity of benchmarks that incorporate language-specific idiosyncrasies and cultural nuances. The insights from our study advocate for the development of domain-specific evaluation frameworks that can more accurately assess and drive the progress of embedding models in low-resource settings. ...

February 10, 2025 · 2 min · Research Team

Perpetual Demand Lending Pools

Perpetual Demand Lending Pools ArXiv ID: 2502.06028 “View on arXiv” Authors: Unknown Abstract Decentralized perpetuals protocols have collectively reached billions of dollars of daily trading volume, yet are still not serious competitors on the basis of trading volume with centralized venues such as Binance. One of the main reasons for this is the high cost of capital for market makers and sophisticated traders in decentralized settings. Recently, numerous decentralized finance protocols have been used to improve borrowing costs for perpetual futures traders. We formalize this class of mechanisms utilized by protocols such as Jupiter, Hyperliquid, and GMX, which we term~\emph{“Perpetual Demand Lending Pools”} (PDLPs). We then formalize a general target weight mechanism that generalizes what GMX and Jupiter are using in practice. We explicitly describe pool arbitrage and expected payoffs for arbitrageurs and liquidity providers within these mechanisms. Using this framework, we show that under general conditions, PDLPs are easy to delta hedge, partially explaining the proliferation of live hedged PDLP strategies. Our results suggest directions to improve capital efficiency in PDLPs via dynamic parametrization. ...

February 9, 2025 · 2 min · Research Team

Currency Arbitrage Optimization using Quantum Annealing, QAOA and Constraint Mapping

Currency Arbitrage Optimization using Quantum Annealing, QAOA and Constraint Mapping ArXiv ID: 2502.15742 “View on arXiv” Authors: Unknown Abstract Currency arbitrage capitalizes on price discrepancies in currency exchange rates between markets to produce profits with minimal risk. By employing a combinatorial optimization problem, one can ascertain optimal paths within directed graphs, thereby facilitating the efficient identification of profitable trading routes. This research investigates the methodologies of quantum annealing and gate-based quantum computing in relation to the currency arbitrage problem. In this study, we implement the Quantum Approximate Optimization Algorithm (QAOA) utilizing Qiskit version 1.2. In order to optimize the parameters of QAOA, we perform simulations utilizing the AerSimulator and carry out experiments in simulation. Furthermore, we present an NchooseK-based methodology utilizing D-Wave’s Ocean suite. This methodology enables a comparison of the effectiveness of quantum techniques in identifying optimal arbitrage paths. The results of our study enhance the existing literature on the application of quantum computing in financial optimization challenges, emphasizing both the prospective benefits and the present limitations of these developing technologies in real-world scenarios. ...

February 8, 2025 · 2 min · Research Team

High-Frequency Market Manipulation Detection with a Markov-modulated Hawkes process

High-Frequency Market Manipulation Detection with a Markov-modulated Hawkes process ArXiv ID: 2502.04027 “View on arXiv” Authors: Unknown Abstract This work focuses on a self-exciting point process defined by a Hawkes-like intensity and a switching mechanism based on a hidden Markov chain. Previous works in such a setting assume constant intensities between consecutive events. We extend the model to general Hawkes excitation kernels that are piecewise constant between events. We develop an expectation-maximization algorithm for the statistical inference of the Hawkes intensities parameters as well as the state transition probabilities. The numerical convergence of the estimators is extensively tested on simulated data. Using high-frequency cryptocurrency data on a top centralized exchange, we apply the model to the detection of anomalous bursts of trades. We benchmark the goodness-of-fit of the model with the Markov-modulated Poisson process and demonstrate the relevance of the model in detecting suspicious activities. ...

February 6, 2025 · 2 min · Research Team

Impermanent loss and Loss-vs-Rebalancing II

Impermanent loss and Loss-vs-Rebalancing II ArXiv ID: 2502.04097 “View on arXiv” Authors: Unknown Abstract This paper examines the relationship between impermanent loss (IL) and loss-versus-rebalancing (LVR) in automated market makers (AMMs). Our main focus is on statistical properties, the impact of fees, the role of block times, and, related to the latter, the continuous time limit. We find there are three relevant regimes: (i) very short times where LVR and IL are identical; (ii) intermediate time where LVR and IL show distinct distribution functions but are connected via the central limit theorem exhibiting the same expectation value; (iii) long time behavior where both the distribution functions and averages are distinct. Subsequently, we study how fees change this dynamics with a special focus on competing time scales like block times and ‘arbitrage times’. ...

February 6, 2025 · 2 min · Research Team

Quantum Powered Credit Risk Assessment: A Novel Approach using hybrid Quantum-Classical Deep Neural Network for Row-Type Dependent Predictive Analysis

Quantum Powered Credit Risk Assessment: A Novel Approach using hybrid Quantum-Classical Deep Neural Network for Row-Type Dependent Predictive Analysis ArXiv ID: 2502.07806 “View on arXiv” Authors: Unknown Abstract The integration of Quantum Deep Learning (QDL) techniques into the landscape of financial risk analysis presents a promising avenue for innovation. This study introduces a framework for credit risk assessment in the banking sector, combining quantum deep learning techniques with adaptive modeling for Row-Type Dependent Predictive Analysis (RTDPA). By leveraging RTDPA, the proposed approach tailors predictive models to different loan categories, aiming to enhance the accuracy and efficiency of credit risk evaluation. While this work explores the potential of integrating quantum methods with classical deep learning for risk assessment, it focuses on the feasibility and performance of this hybrid framework rather than claiming transformative industry-wide impacts. The findings offer insights into how quantum techniques can complement traditional financial analysis, paving the way for further advancements in predictive modeling for credit risk. ...

February 6, 2025 · 2 min · Research Team

Efficient Triangular Arbitrage Detection via Graph Neural Networks

Efficient Triangular Arbitrage Detection via Graph Neural Networks ArXiv ID: 2502.03194 “View on arXiv” Authors: Unknown Abstract Triangular arbitrage is a profitable trading strategy in financial markets that exploits discrepancies in currency exchange rates. Traditional methods for detecting triangular arbitrage opportunities, such as exhaustive search algorithms and linear programming solvers, often suffer from high computational complexity and may miss potential opportunities in dynamic markets. In this paper, we propose a novel approach to triangular arbitrage detection using Graph Neural Networks (GNNs). By representing the currency exchange network as a graph, we leverage the powerful representation and learning capabilities of GNNs to identify profitable arbitrage opportunities more efficiently. Specifically, we formulate the triangular arbitrage problem as a graph-based optimization task and design a GNN architecture that captures the complex relationships between currencies and exchange rates. We introduce a relaxed loss function to enable more flexible learning and integrate Deep Q-Learning principles to optimize the expected returns. Our experiments on a synthetic dataset demonstrate that the proposed GNN-based method achieves a higher average yield with significantly reduced computational time compared to traditional methods. This work highlights the potential of using GNNs for solving optimization problems in finance and provides a promising approach for real-time arbitrage detection in dynamic financial markets. ...

February 5, 2025 · 2 min · Research Team