Research optimizes C++ patterns for HFT, reducing latency and improving profitability.
problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.
Study validates low latency's impact on trading profits.
problem Determining the impact of low latency on trading profits.
method Agent-based simulation of trading strategies in a controlled environment.
result Latency inversely affects trading profits; latency rank is key.
Speed bumps reduce but do not fully eliminate investment in fast trading technology.
problem Limiting low-latency trading to curb investment in fast trading technology.
method Built an experimental trading platform to test the effects of speed bumps on investment in fast trading technology.
result Asymmetric speed bumps reduce investment in speed by only 20%, and increasing the magnitude further reduces investment by 8.33%. Symmetric speed bumps have no effect on investment levels.
The possibility of latency arbitrage in financial markets has led to the deployment of high-speed communication links between distant financial centers. These links are noisy and so there is a need for coding. In this paper, we develop a gametheoretic model of trading behavior where two traders compete to capture laten…
Blockchain trading faces limits due to time-consuming settlement, exposing arbitrageurs to price risk.
problem Time-consuming settlement in blockchain trading limits arbitrage opportunities.
method Analysis of Bitcoin network and order book data.
result Cross-exchange price differences coincide with high settlement latency and low default risk.
DEX allows HFTs to quickly acquire speed, improving price discovery without sacrificing liquidity.
problem Low-latency trading's externality and resource inefficiency in centralized exchanges.
method Model of decentralized exchanges with real-time speed acquisition from peer-to-peer networks.
result HFTs on DEX acquire more speed for shorter timespans, decreasing price discovery time and reducing resource lock-in.
New strategy improves liquidity takers' performance in markets with latency.
problem Latency affects liquidity takers' ability to execute limit orders effectively.
method Modelled LOB and MLOs as a marked point process, used variational analysis and FBSDEs to find optimal price limits.
result Optimal trading strategy improves marksmanship in markets with latency.
Cloud-native simulator studies global trading latencies.
problem Understanding latencies in planetary-scale automated trading systems.
method Cloud-native, open-source simulator with distributed clients.
result Demonstrates latencies in real-world trading systems.
CoinTossX is a low-latency, open-source matching engine for financial trading.
problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.
PolySwarm uses a swarm of LLMs to predict and arbitrage prediction markets.
problem Real-time prediction market trading and latency arbitrage inefficiencies.
method PolySwarm employs a swarm of 50 diverse LLMs, Bayesian combination, and risk-controlled execution.
result Swarm aggregation outperforms single-model baselines in prediction tasks.
This paper studies optimal market making for large-tick assets in the presence of latency. We consider a random walk model for the asset price, and formulate the market maker's optimization problem using Markov Decision Processes (MDP). We characterize the value of an order and show that it plays the role of one-period…
High frequency trading has led to widespread efforts to reduce information propagation delays between physically distant exchanges. Using relativistically correct millisecond-resolution tick data, we document a 3-millisecond decrease in one-way communication time between the Chicago and New York areas that has occurred…
The SIP's accuracy is questioned, leading to skewed returns for high-volume stocks.
problem Inaccuracy of the SIP in reporting trades and quotes.
method Analysis of Trade and Quote data, use of first differences to highlight latency and inaccuracy.
result Up to 60% of trades are reported out of sequence, skewing returns.
A dealer manages quotes and rejection rules to control slippage risk in FX markets.
problem Managing inventory risk and latency risk in OTC FX market making.
method Dynamic programming and adiabatic-quadratic approximation to optimize quotes and rejection rules.
result Developed a method to optimize quotes and rejection rules for managing slippage risk.
This paper is split in three parts: first we use labelled trade data to exhibit how market participants accept or not transactions via limit orders as a function of liquidity imbalance; then we develop a theoretical stochastic control framework to provide details on how one can exploit his knowledge on liquidity imbala…
TinyML models detect RF and cyber threats in spacecraft with low latency.
problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.
FlashIV solves Black-Scholes implied volatility efficiently and accurately.
problem Efficiently calculating implied volatility for financial models.
method Normalizes inputs, uses asymptotic seed, and combines Householder refinement.
result Runs faster than existing methods while maintaining accuracy.
Optimal trading strategy between CEXs and DEXs with priority fees and stochastic delays.
problem Managing latency risk in trading between centralized and decentralized exchanges.
method Developed a mixed control framework combining absolutely continuous controls with impulse interventions, allowing for stochastic execution delays and multiple pending orders.
result Optimal priority fee selection significantly outperforms non-strategic fee selection.
Improves text-to-speech speed by interleaving character reading and audio synthesis.
problem Latency in text-to-speech models limits their use in time-sensitive tasks.
method Reinforcement learning to train an agent to choose the order of character reading and audio synthesis.
result The proposed method successfully balances latency and audio quality.
Freezing intermediate layers reduces DNN inference latency.
problem High latency in deep learning inference due to computationally expensive models.
method Introduce approximate caching at each intermediate layer to avoid running all layers for many inference requests.
result Reduces the number of effective layers by half for 91.58% of CIFAR-10 requests.
Paper analyzes how latency affects optimal order execution in markets.
problem Balancing profit from optimal order execution against execution risk.
method Stochastic optimal control problem with risk-averse trader.
result Closed-form approximations of fill probability, limit price, and latency.
DCT-SNN uses DCT to reduce inference latency in SNNs.
problem High inference latency in SNNs.
method Proposes a time-based encoding scheme using DCT to reduce timesteps.
result Achieves top-1 accuracy comparable to standard deep learning while reducing inference latency.
Modeling HFT interactions reveals market instability.
problem Market instability caused by HFT dynamic coupling.
method Developed a recurrence relations framework to model HFT interactions.
result Unexpected latency and feedback can trigger market instability.
Simulates realistic execution and costs in limit order books.
problem Realistic simulation of limit order books for large-tick assets.
method Tractable representation of spread and volume imbalance; calibrated event timing; feedback mechanism for market impact.
result Simulator yields realistic behavior and sensitivity to execution parameters.
Microstructure of market dynamics is studied through analysis of tick price data. Linear trend is introduced as a tool for such analysis. Trend arbitrage inequality is developed and tested. The inequality sets limiting relationship between trend, bid-ask spread, market reaction and average update frequency of price inf…
Select-DC reduces GFLOPS for uncertainty estimation in neural networks.
problem Computational inefficiency in estimating model uncertainty for low-latency applications.
method Select-DC uses a subset of layers to model epistemic uncertainty with MCDC, reducing GFLOPS.
result Significant reduction in GFLOPS required for uncertainty estimation with marginal performance loss.
Two new methods reduce random forest latency and improve accuracy.
problem High latency and memory demands in deep random forest models.
method DiNo and RanBu convert shallow random forests into efficient predictors.
result RanBu matches or exceeds full-depth random forest accuracy with up to 95% reduction in time.
This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.
problem Comparing nearest neighbor search systems in Hamming space.
method Comprehensive evaluations of indexing speed, search latency, and RAM consumption.
result Better understanding of trade-offs between main memory and secondary memory systems.
Study shows time matters in automated trading, improving simple strategies over complex ones.
problem Effects of reaction speed and trading urgency on automated trading strategies.
method Simulated financial markets with public limit order book and continuous double auction matching. Examined reaction speed and trading urgency.
result Simple strategies outperform complex ones when considering reaction speed and trading urgency.
A blockchain-based federated learning system with latency analysis.
problem Latency issues in decentralized federated learning architectures.
method Introduced a consortium blockchain and a latency model to analyze the workflow.
result The latency model accurately quantifies actual delays in the system.
Co-trading networks reveal dynamic market structures and improve covariance estimation.
problem Modeling high-dimensional stock covariances in US equity markets.
method Co-trading-based pairwise similarity measure for constructing dynamic networks, spectral clustering, robust covariance estimator.
result Co-trading networks capture time-evolving stock dependencies and improve portfolio performance.
New measures detect HFT activity, revealing its impact on stock prices.
problem Lack of public data on HFT activity.
method Developed machine learning models to predict HFT activity using proprietary and public data.
result Measures outperform conventional proxies and reveal HFT's impact on price discovery.
Innovative neural networks reduce memory usage for efficient, accurate segmentation.
problem Efficiently segmenting large graphs with limited memory.
method Iterative neural networks with loops and multiple outputs.
result State-of-the-art semantic segmentation results on demanding datasets.
Optimizes latency and false alarm probability in change detection problems.
problem Balancing latency and false alarms in non-stationary environments.
method Develops order-optimal change detectors under specified latency and false alarm levels.
result Derives a universal lower bound on latency and develops order-optimal detectors.
Research examines how strategic latency manipulation impacts Ethereum's network efficiency and decentralization.
problem Impact of artificial latency on Ethereum's network efficiency and decentralization.
method Comprehensive analysis of MEV-Boost auction system and empirical validation with a pilot.
result Increased profitability for node operators and significant systemic challenges like heightened network inefficiencies and centralization risks.
This paper presents a fast Bayesian filtering technique for state estimation.
problem Bottleneck in Bayesian inference for state estimation from noisy sensor data.
method Processor-native uncertainty tracking for uncertainty propagation and inference.
result Deterministic approximate filtering with up to 805x speedup and competitive accuracy.
Trading system uses NP-hard optimization to select stocks for high Sharpe ratio trading.
problem Finding profitable, uncorrelated stocks for high Sharpe ratio trading.
method NP-hard combinatorial optimization using Ising machine and simulated bifurcation algorithm.
result Trading strategy with FPGA-based system achieves 164 μs response latency.
The Tick library simulates and learns Hawkes processes with latency effects.
problem Correctly modeling causality in order book events with latency.
method Exponential kernels shifted by latency, derived log-likelihood expressions.
result Latency determines most decays in real data, showing decay relationships.
MASnet enhances speech on mobile devices with low latency.
problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.
Enhances pairs trading with neural networks and Kalman Filters.
problem Inaccurate linear models in pairs trading lead to suboptimal performance.
method Augments Kalman Filter with Neural Networks to improve financial indicator extraction.
result Empirically shows improved trading performance compared to benchmarks.
CryptoNAS improves PI accuracy by 3.4% with 2.4x less latency.
problem Private inference on machine learning models with limited latency.
method Developed CryptoNAS, a novel NAS method for finding models that maximize accuracy within a ReLU budget.
result Improves accuracy by 3.4% and latency by 2.4x over state-of-the-art methods.
This paper reviews methods to create compact neural networks for IoT applications.
problem Complex deep neural networks are costly and slow, hindering real-world deployment.
method Automatic synthesis of compact, accurate DNN/LSTM models.
result Compact neural networks reduce energy consumption, memory, and inference time.
Proposes deep-RL with GANs for ultra-reliable low-latency communication.
problem Resource allocation for URLLC with high reliability and low latency.
method Experienced deep-RL framework using GANs to pre-train and optimize resource allocation.
result Deep-RL framework achieves near-optimal reliability and latency under URLLC constraints.
PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.
problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.
Two solutions improve privacy-preserving inference with reduced latency and wider neural network support.
problem Balancing accuracy, security, and computational complexity in machine learning with sensitive data.
method Combining Homomorphic Encryption with transfer learning and novel data representation methods.
result More than 10x improvement in latency with wider neural network support.
Quantum computing improves fill probability estimation in bond trading.
problem Estimating fill probabilities in complex financial markets with uncertainties.
method Quantum learning algorithms applied to real bond trading data.
result Quantum-enhanced models achieve up to 34% better performance in fill prediction.
Collage-CNN reduces cloud inference latency by 1.47X with 9X reduced latency variation.
problem Reducing latency variance in cloud machine learning inference.
method Proposes a novel Collage-CNN model that combines multiple images for classification, providing redundancy and cost efficiency.
result Significant reduction in 99th percentile tail latency and variation in inference latency.
This paper optimizes AI inference on edge devices with reduced communication and computation costs.
problem Efficiently performing AI inference on resource-constrained edge devices with reduced communication and computation costs.
method A three-step framework for effective inference: model split point selection, communication-aware model compression, and task-oriented encoding of intermediate features.
result Our proposed framework achieves a better trade-off and significantly reduces inference latency compared to baseline methods.