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

Trend · papers per month

20416181 · Jun 202019922001200920172026
48 results for execution phase

This study examines the execution phase of corporate share buy-backs, highlighting inefficiencies and costs.

problem Lack of research on share buy-back execution practices and associated costs.
method Comparative analysis of execution practices and fees charged to corporations and investors.
result Uncovered inefficiencies and frictional costs in share buy-back executions, advocating for transparency and fairness.

We propose the Insertion-Deletion Transformer, a novel transformer-based neural architecture and training method for sequence generation. The model consists of two phases that are executed iteratively, 1) an insertion phase and 2) a deletion phase. The insertion phase parameterizes a distribution of insertions on the c…

2020-01-15abs ↗pdf ↗

Many learning agents impact a financial market model, showing complex dynamics.

problem Understanding the dynamics of financial markets with multiple learning agents.
method Agent-based model of financial market with multiple reinforcement learning agents interacting.
result Inclusion of learning agents changes market dynamics to match empirical data.

Study analyzes price change patterns across different market capitalizations using Markov chains.

problem Understanding price dynamics in limit order markets across various market capitalizations.
method Discrete-time Markov chain analysis of intraday price changes in NASDAQ100 tick data.
result Systematic patterns in price inertia and stability across market capitalizations are identified.

We study the market impact of a meta-order in the framework of the Minority Game. This amounts to studying the response of the market when introducing a trader who buys or sells a fixed amount h for a finite time T. This perturbation introduces statistical arbitrages that traders exploit by adapting their trading strat…

2011-12-16abs ↗pdf ↗

Agents trained with reinforcement learning deviate from Nash equilibrium in optimal execution game.

problem Deviation of reinforcement learning strategies from Nash equilibrium in optimal execution game.
method Two-player optimal execution game with reinforcement learning algorithms (Double Deep Q-Learning).
result Strategies learned by agents deviate significantly from Nash equilibrium, exhibiting supra-competitive solutions.

Maximizes Rényi entropy for efficient exploration in reward-free RL.

problem Challenges of exploration in reward-free reinforcement learning.
method Maximizes Rényi entropy over state-action space in exploration phase; uses batch RL for planning phase.
result Effective and sample-efficient exploration leading to superior policies.

We present a general framework for accelerating a large class of widely used Markov chain Monte Carlo (MCMC) algorithms. Our approach exploits fast, iterative approximations to the target density to speculatively evaluate many potential future steps of the chain in parallel. The approach can accelerate computation of t…

2014-03-28abs ↗pdf ↗

LEMs extend transformer-based architectures for complex execution problems.

problem Handling flexible time boundaries and multiple execution constraints in deep learning.
method Decouples market information processing from execution allocation decisions using TKANs, VSNs, and multi-head attention mechanisms.
result LEMs achieve superior execution performance compared to traditional benchmarks.

Proposes a method to allocate time budgets in mixed criticality systems.

problem Managing execution time variability in mixed criticality systems.
method Quantifies execution time variability using statistical dispersion parameters and proposes a heuristic to allocate time budgets.
result The proposed heuristic reduces the probability of exceeding allocated budgets.

The paper analyzes trade execution strategies for large traders in a stochastic market environment.

problem Analyzing trade execution strategies in a stochastic market with price impact.
method Formulated a Markov game model and used backward induction method of dynamic programming.
result Explicit closed-form execution strategy at Markov perfect equilibrium.

Counterfactual policy evaluation improves autonomous driving policies' generalization.

problem Learnt policies often fail to generalize and handle novel situations.
method Introduces counterfactual policy evaluation using counterfactual worlds.
result Significantly decreases collision-rate while maintaining high success-rate.

Paper uses DDPG to learn optimal execution strategies in dynamic markets.

problem Learning non-Markovian optimal execution strategies in dynamic financial markets.
method Introduces a novel actor-critic algorithm based on DDPG for transient price impact modeling.
result Successfully approximates optimal execution strategy through numerical experiments.

Paper proposes a novel policy distillation method for better order execution in noisy markets.

problem Effective order execution in noisy and imperfect market conditions.
method Policy distillation method to guide reinforcement learning towards optimal trading strategies.
result Significant improvements over various baselines in order execution.

Unified theory for optimal execution through signal-adaptive quotes in limit order books.

problem Optimal execution in limit order books with signal-dependent factors.
method Develops a unified solution theory for four execution criteria, incorporating signal-dependent drift, price impact, inventory risk, and execution risk.
result Explicit formulas reveal optimal quoting strategies and show signal-dependent drift can significantly affect execution.

Dynamic VWAP execution improves by 10-15% in liquid markets.

problem Improving VWAP execution in dynamic markets.
method Recurrent Neural Networks (RNNs) for capturing temporal market dynamics, dynamic adjustment mechanism.
result Significant performance gains in liquid markets (10-15%) over traditional methods.

The study provides precise asymptotic theory for in-context learning by Transformers.

problem Understanding the sample complexity, pretraining task diversity, and context length for successful in-context learning.
method An exactly solvable model of linear regression task by linear attention, deriving sharp asymptotics.
result Double-descent learning curve with increasing pretraining examples, phase transition between low and high task diversity regimes.

Vanishing gradients hinder reinforcement finetuning of language models.

problem Vanishing gradients impede the optimization of language models using reinforcement finetuning.
method The study identifies vanishing gradients as a fundamental optimization obstacle in reinforcement finetuning and proposes an initial supervised finetuning phase to mitigate this issue.
result An initial supervised finetuning phase is crucial for successful reinforcement finetuning of language models, as it helps prevent vanishing gradients and maximizes rewards.

Optimal trading strategies in fluctuating financial markets are analyzed using complex mathematical models.

problem Optimal execution of trades in markets with fluctuating liquidity and order book depth.
method Continuous-time limit order book model with càdlàg semimartingale strategies, quadratic BSDEs.
result Characterization of minimal execution costs and existence of optimal strategies.

The volume weighted average price (VWAP) execution strategy is well known and widely used in practice. In this study, we explicitly introduce a trading volume process into the Almgren-Chriss model, which is a standard model for optimal execution. We then show that the VWAP strategy is the optimal execution strategy for…

2014-08-26abs ↗pdf ↗

Sunshine trading theory predicts lower execution costs and liquidity provision through explicit preannouncements, but evidence is scarce in traditional markets.

problem Adverse selection on liquidity provision
method Reconstructing metaorders and comparing them with visible TWAP executions
result Visible TWAPs face lower execution costs and leave a smaller permanent price impact compared to hidden metaorders.

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.

The paper addresses optimal execution for multi-asset portfolios using Ornstein-Uhlenbeck dynamics.

problem Optimal execution for multi-asset portfolios with Ornstein-Uhlenbeck dynamics.
method Stochastic optimal control and simplification of Hamilton-Jacobi-Bellman equation to ODEs.
result Existence and uniqueness of solution to the execution problem using extit{a priori} estimates.

Optimal order execution strategies for brokers under reference benchmarks.

problem Maximizing broker's utility of excess profit-and-loss subject to reference strategies.
method Formulated as a utility maximization problem, optimal strategies derived in closed form.
result General reference strategies can be approximated by piece-wise linear combinations of IS and TC orders.

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

problem Solving parametric mixed-integer linear optimization problems with changing data.
method Introducing cutting-plane layers (CPLs) for differentiable cutting-plane generation.
result The algorithm computes solutions with low integrality gaps and generalizes to unseen instances.

Study uses SGD to find near-optimal execution cost policies in dynamic markets.

problem Finding optimal execution cost policies in complex markets.
method Stochastic Gradient Descent (SGD) approach to derive near-optimal policies.
result SGD-based policies offer valuable insights and are implementable in volatile markets.

ICON-OCnet solves optimal execution problems with neural networks and few examples.

problem Optimal order execution in markets with unknown price impact.
method Transformer-based neural network architecture (ICON-OCnet) that learns price impact from few examples and applies it to optimal execution strategies.
result ICON-OCnet accurately infers price impact models and retrieves optimal execution strategies for various propagator kernels.

RL optimizes trading algorithms to reduce market impact and costs.

problem Optimizing sophisticated trading algorithms to minimize market impact and costs.
method Reinforcement learning framework within a market simulator.
result RL-derived strategies consistently outperform baselines and operate near the efficient frontier.

Optimizes trade execution with reinforcement learning for limit orders.

problem Maximizing revenue in a limit order book with market and limit orders.
method Formulated as a dynamic allocation task, uses multivariate logistic-normal distributions for efficient training.
result Outperforms traditional strategies in simulated environments.