alphaFeedback

WorksEconomics, Econometrics and Finance

LOB-Impact Benchmark: Emergent Market Impact in Generative Limit Order Book Models

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link
View

Abstract

Realistic market impact is essential for generative limit order book (LOB) models to serve as world models for trading agents. If a simulator misprices this mechanism, agents learn policies that are optimal in the simulator but wrong in the real market. Existing metrics assess generated streams purely through distributional comparison with historical data, leaving counterfactual response to an agent's own orders largely unexplored. Here, we show that market impact emerges naturally in neural LOB generators trained solely for next-token prediction. We inject execution-style metaorders into the generated message flow of five autoregressive models across five NASDAQ stocks and measure the response using estimators from the empirical impact literature, validated on baselines whose physics is known in advance. Our benchmark evaluates any message-level generator in three phases: free generation (reading order-flow persistence against price diffusivity); metaorder injection (yielding the impact law's exponent and amplitude); and a post-execution window (measuring relaxation). In addition, comparing each visible injection to a blind, simulator-only control isolates the model's learned response from standard book mechanics. For every model on every stock, we measure how the impact responds as a function of cumulative metaorder participation. Interestingly, we observe emergent impact in generative models of market data, with exponents in the range of 0.63 to 1.21, slightly above the traditional 0.5 of the square-root law of impact. In the family of models tested, we are so far unable to observe impact decay during relaxation. We tentatively attribute this to the still-short context windows of the models. We release the benchmark as open source to validate future generative models for market data.

CCS Concepts

• Computing methodologies → Simulation evaluation; • Applied computing → Economics.

Keywords

limit order book, generative AI, market impact, square-root law, evaluation benchmark, state-space models, reinforcement learning

This work is licensed under a Creative Commons Attribution 4.0 International License.

ICAIF ’26, Milan, Italy

© 2026 Copyright held by the owner/author(s).

ACM ISBN 979-8-4007-3087-0/2026/11

https://doi.org/10.1145/3858063.3858909

ACM Reference Format:

George Nigmatulin, Valentin Mohl, Sascha Frey, Kang Li, Aramis Marti-Shahandeh, Mihai Cucuringu, Anisoara Calinescu, Jakob Foerster, and Stefan Zohren. 2026. LOB-Impact Benchmark: Emergent Market Impact in Generative Limit Order Book Models. In 7th ACM International Conference on AI in Finance (ICAIF ’26), November 14–17, 2026, Milan, Italy. ACM, New York, NY, USA, 9 pages. https://doi.org/10.1145/3858063.3858909

Introduction

Generative LOB models (GANs [10], recurrent and state-space message generators [14, 26, 31, 33], transformers and diffusion [2, 18]) are judged today by how closely their message streams resemble historical ones. Distributional benchmarks such as LOB-Bench [25] make this comparison precise by scoring spread, volume, interarrival, and imbalance distributions against real data. Such simulators are candidates to serve as world models for reinforcement-learning agents [12, 23], and an agent trained inside a simulator that gets the response to its orders wrong will learn mispriced policies, even if the surrounding stream looks realistic. Distributional scores are blind to this response, and existing benchmarks measure it only for a single event.

Constructing such a benchmark requires examining how real markets absorb large trades. Institutions do not execute a large order at once; they split it into small child orders. Empirical finance provides the reference for what such a metaorder does to the price: the square-root law of metaorder impact,

I(Q)=σ⋅Y⋅(QV)β,β≈0.5,(1)I(Q) = \sigma\cdot Y \cdot\left(\frac{Q}{V}\right)^{\beta}, \qquad\beta\approx0.5, \tag*{(1)}

where I(Q)I(Q) is the expected price change, σ\sigma the daily volatility, QQ the metaorder size, VV the daily volume, and YY a dimensionless amplitude; the law is documented across equities, futures, and FX [1, 6, 32]. This law is driven by two forces: persistence and resilience. Order flow is highly persistent: the sign of the next trade is predictable from the previous one [19]. If every trade permanently moved the price, this persistence would cause indefinite trends. Instead, prices remain diffusive because the market absorbs and relaxes from each push [7]. The law’s concavity emerges when the liquidity a metaorder consumes is replenished behind it, and this same replenishment brings the price back down once execution stops [13]. In free generation, persistence is directly observable; resilience appears only indirectly as a diffusive price.

Isolating resilience therefore needs a counterfactual: how prices would have moved under an exogenous metaorder. A historical trace cannot answer that; a generator can. LOB-Bench measures this response at the scale of a single event. At the metaorder scale, MarS reports a square-root-shaped response to injected TWAP orders [18], and Bodor and Carlier [5] an exponent of 0.55 on a ten-child metaorder. However, these experiments do not separate the mechanical impact, where the injected orders remove levels of the price, from indirect impact through the reactions of other participants to those orders. In a generator, other participants are the model itself, and resilience lives in its reaction alone.

Our aim is to design experiments that measure these counterfactuals and isolate indirect impact. In our procedure, metaorders injected into five neural state-space generators produce an identifiable impact law on every stock we run: 25 model–stock pairs, 25 identifications. We provide an automatic per-stock calibration; every build-up injection is paired with a blind run that separates the model’s reaction from the book’s mechanics, and a number is reported only when a law is identified. This procedure extends distributional benchmarking, providing an instrument for evaluating the interactive fidelity of LOB simulators.

Methodology

Benchmark design

The benchmark takes four inputs: the model under test, a stock, a calibration computed from that stock’s own data (§ 2.3), and a budget of nn rollouts per direction per phase, spread over every trading day of the month. It runs three phases with two paired controls (Figure 1, left). Everything downstream is fixed before any model is run: the injection schedule, calibration and estimator are set by the stock and the protocol, never by the model under test.

The benchmark and its counterfactual probe

Figure 1. The benchmark and its counterfactual probe. Left: four inputs, three phases, and the claim ladder they decide, each row reading claim · variable · pass criterion. Phase 1 generates freely and decides the balance (C1); Phase 2 injects the build-up and decides existence (C2), attribution (C3) and the square-root law (C4); Phase 3 injects, then falls silent, and decides relaxation (C5). Schedules print as (what is injected; children ii; silent blocks cc). Every build-up injection runs twice, visible and blind: same windows and seeds, the orders fill in the simulator while neither model input (message stream, book state) carries them, and the visible-over-blind ratio attributes the response to the model itself (C3). Table 3 prints the resulting ladder for every model × stock. Right: the injection protocol. After a conditioning window (Context), aggressive children are injected ΔN\Delta_N model-generated messages apart; the post-execution phase injects none. The traced paths are the real-market expectation the benchmark tests against: a transient response decaying towards a permanent level. The sell experiment mirrors the buy; the two combine by antisymmetrisation (Eq. (2)), and the experiment repeats over many windows (stacked frames).

Phase 1: free generation. The model runs freely over the injection horizon (the length of one build-up metaorder: 12k–73k messages depending on the stock, Table 2). For this phase, we measure the following three observables. The first is a consistency pair: γflow\gamma_{\mathrm{flow}}, the decay exponent of the trade-sign autocorrelation (smaller means longer memory), read against HH, the Hurst exponent of the generated mid-price (H=0.5H = 0.5 is diffusive). Persistent signs must be compensated by transient impact, so a generator that combines persistent flow with a super-diffusive price (H>0.5H > 0.5) has built a free lunch into its own market [7]. The second is the free drift a rollout accumulates with nothing injected. The third is the price response to a single trade, against the real stream. Phase 1 serves as a first filter: the replay passes it perfectly yet has no impact at all, so establishing impact requires an intervention.

StockCohortChild (±std)ΔN\Delta_N (±std)ϕ\phigen
EALow OTR17 (±4)122 (±125)7.49%12k
NVDAMid (modal)31 (±7)250 (±35)3.65%25k
MSFTMid (modal)19 (±3)261 (±59)3.68%26k
AMDHigh OTR20 (±3)401 (±69)2.30%40k
GOOGHigh OTR (tail)23 (±2)729 (±183)1.30%73k

Table 2. Selected stocks, one per cohort (day-mean, whole shares, January 2026). “Child” is the median market-order size, used as the child size; ± = std across days; “gen” is the messages a 100-child pull-up metaorder must generate. Figure 2 and Figure 4 show AMD; the others are in Table 3 only.

Phases 2 & 3: metaorder injection and relaxation. The injection realises the counterfactual of § 1: the same conditioning windows, run again under an exogenous metaorder. After a conditioning window from the real stream, we alternate one aggressive child of median trade size with ΔN\Delta_N generated messages, the spacing that holds participation at η=10%\eta= 10\% (§ 2.3) (Figure 1, right). Two shapes probe the two faces of impact. The build-up shape (i=100i=100, c=0c=0) reads the impact exponent along a 100-child order, a typical real length (§ 2.3). The relaxation shape (i=10i=10, c=100c=100) executes a short metaorder and then stops injecting for 100 silent blocks: ten execution durations, over which real impact falls to about two-thirds of its peak within one to two durations and to about one-half by the tenth [9, 24]. Every configuration runs in both directions, and the two are combined as

I=12(Ibuy−Isell),(2)I = \frac{1}{2}\left(I_{\mathrm{buy}} - I_{\mathrm{sell}}\right), \tag*{(2)}

which also handles free drift: direction-independent drift cancels in Eq. (2) and is measured separately on the no-injection arm, entering the accounting exactly once.

Blind control. An identified law does not say whose law it is. The replay kernels of Table 1, with no model inside, are identified on AMD at δ=0.73\delta= 0.73–0.810.81, inside the neural range, so the exponent cannot attribute the response, and a large amplitude could be purely mechanical impact. The build-up therefore runs twice on the same windows and seeds, once visible and once blind. In the blind run, the orders fill in the simulator, but neither model input (message stream, book state) carries them, so the generated flow proceeds as if the metaorder never happened. This allows us to single out the indirect impact. The laws are fitted on the visible runs. The blind control covers only the build-up: Phase 3 reads a ratio within one visible run, which a floor ten times below the peak cannot change.

ModelClassHow it worksTrained / calibrated onGen.
HistoricreplayReplays the real stream unchanged; cannot react.real held-out data—
Heuristicreplay + shiftReplay; a consumed best level shifts all later messages.rule fixed a priori—
Propagatorreplay + kernelReplay + one-tick kicks decaying as 23+13s−1/2\frac{2}{3}+\frac{1}{3}s^{-1/2}.kernel from theory [6]—
OWreplay + kernelReplay + Obizhaeva–Wang exponential-resilience kernel.kernel from theory [27]—
CSTparametricMemoryless event rates vs distance from mid [11].rates on the stock, Jan 2026∼\sim4 s
NMZIparametricCST + return-driven order-sign feedback [29].as CST; feedback at defaults∼\sim4 s
Hawkespoint processSelf-/cross-exciting intensities; short-range clustering [4].kernels on the stock, Jan 2026∼\sim4 s
QRparametricQueue-reactive intensities conditioned on the book [16].intensities on the stock, Jan 2026∼\sim4 s
S5-120Mneural SSMAutoregressive next-token generation; S5 backbone [31].GOOG, AAPL, NVDA, AMZN, META, TSLA, MSFT, AMD; Jan 2022–Dec 2025; Jan 2026 (the evaluation month) held out.53 s
S5-4kneural SSMS5 with a 4000-message conditioning window.∼\sim12 min
Mamba3neural SSMSelective state-space backbone [14, 17].39 s
Mamba3-4kneural SSMMamba-3 with a 4000-message conditioning window†.∼\sim12 min
GDNneural SSMGated-DeltaNet recurrence [33].54 s

Table 1. Models under test. Top block: non-neural baselines, calibrated (where anything is fitted) on the evaluation stock itself. Bottom block: neural generators sharing one corpus (merged cell) that includes AMD, so every neural measurement is in-distribution. “Gen.” is the wall-clock for one build-up rollout (∼\sim40k messages): replay baselines transform a stored stream (—), parametric baselines run on CPU, neural models on one H100. †Fine-tuned with a 2000-message context and run with a 4000-message window.

The horizon is set by the object, not by the model. Market impact is a property of the metaorder, the working unit of optimal execution [3, 15], and only at that scale can an emergent impact law be demonstrated. A build-up rollout therefore runs about 40k messages on AMD, far past the 500-message training window of latter-day models (Table 1). The no-injection arm (free generation at this horizon, the second paired control) also tracks rollout degradation.

Sample sizes are part of the protocol. Rollouts buy detection: resolving a peak PP at three standard errors takes n∗=9σ12/P2n^* = 9\sigma_1^2/P^2 per direction, σ1\sigma_1 from a pilot. Trading days buy precision: days are the independent unit and rollouts cannot substitute for them. A cell is printed only when its peak exceeds three standard errors and its law is identified. One campaign per stock (1,024 rollouts per direction per phase over 20 trading days) meets both requirements, with about 1.4× the minimum that subsampling shows is needed. With fewer than five days, the interval is often narrower than the full-sample one, yet contains the full-sample value only 40–68% of the time: the estimate looks precise but is wrong.

Each executed child kk contributes one signed point (qk,Ik)(q_k, I_k), where qk=Qk/Vq_k = Q_k/V is the cumulative participation and IkI_k the mid-price displacement. We write δ\delta for the measured exponent and keep β\beta for the reference 0.5 of Eq. (1). The law I=aqδI = a q^\delta is fitted on the cumulative pool qkq_k, hence every prefix of a metaorder is itself a completed metaorder, the lifecycle convention of the empirical literature [3, 34]. The local exponent declines along a metaorder, as for real ones [34], so δ\delta is always quoted at the full metaorder, under one convention for every model.

Existence is decided before magnitude (Figure 2). The identifiability test fits I=aqδI = a q^\delta directly by least squares, with no logarithms and no sign selection. For each δ\delta on a grid ([0.05,1.5]([0.05, 1.5], step 0.01) the best amplitude has a closed form, a∗(δ)=∑Iqδ/∑q2δa^*(\delta) = \sum Iq^\delta/\sum q^{2\delta}, so the misfit becomes a curve over δ\delta: a real law gives a sharp minimum, and no signal gives a flat curve with a≈0a \approx0. A law counts as not identified when the amplitude is below the floor (∣I∣<0.05|I| < 0.05) or the best δ\delta sits on a grid bound; the master curve (all sizes collapsed onto one) is drawn only when ⟨I(1)⟩\langle I(1)\rangle exceeds three standard errors. Testing existence first is the one step we add to an otherwise standard pipeline; a weighted-mean L1L_1 version guards against outliers. The number, quoted only where a law is identified, is the binned estimator of the empirical literature [30]: 18 quantile bins, signed conditional bin means, OLS through the positive means.

The estimator’s input on AMD: raw signed points and equal-count bins for Historic and S5-120M

Figure 2. The estimator’s input on AMD. Rows: the Historic replay (negative control, top) and S5-120M (bottom). Columns: raw signed points (ln⁡q\ln q, II) (left) and equal-count bins with signed conditional means (right). Half the replay’s points lie at or below zero; signed means cancel where there is no signal, so the replay’s means straddle zero while S5-120M’s rise. The estimator built on these means is defined in the text.

All fits run on raw signed impact; volatility enters only as the unit of the amplitude (II in units of the day’s Parkinson volatility), γ=aqrefδ−1/2/κP\gamma= a q_{\mathrm{ref}}^{\delta-1/2}/\kappa_P at the data edge, with κP=4ln⁡2≈1.665\kappa_P = \sqrt{4\ln2} \approx1.665 converting the Parkinson range [28] to the convention of the empirical studies, so γ\gamma compares directly with the measured γ≈0.5\gamma\approx0.5 [8, 32, 34]. On AMD the binned δ\delta moves by at most 0.05 across six volatility normalisations (none, i.e. σ=1\sigma= 1, and the Parkinson, Garman–Klass, Rogers–Satchell, close-to-close and Yang–Zhang estimators), and the L1L_1 twin agrees wherever a law is identified.

Phase 3 reads relaxation through two numbers: the level at which impact settles and its slope after execution. We compare the level with real metaorders, which relax to one-half to two-thirds of their peak [9, 24], and with the kernel baselines run under the same schedule, whose closed-form value sets the scale of relaxation at this spacing. Fitted directly, the neural decay kernel comes out permanent (γ≈0\gamma\approx0) by two independent methods, schedule ordering and an impulse fit. Days are pooled on a common clock, the executed fraction ν=k/N\nu= k/N of the metaorder, because metaorder impact does not depend on execution duration [6]; cells where fast and slow days still differ materially are marked mm.

The estimator is validated before it is read: laws of known exponent, planted in the replay’s own point cloud (real noise, real day structure), are recovered across δ∈[0.5,1.0]\delta\in[0.5, 1.0] with a small downward bias (at most 0.11 at neural amplitudes), so the exponents reported below are conservative. In 500 null trials with nothing planted, the identifiability test returns not one false law. The kernel baselines close the loop end to end: Phase 3 recovers their built-in resilience in the correct order on all five stocks.

Each cell is finally reduced to a verdict on the five claims of Figure 1 (the C1–C5 column of Table 3), on criteria fixed for every model: C1 when γflow\gamma_{\mathrm{flow}}, HH and the free drift sit within tolerances fixed in advance (0.10, 0.02 and 5 ticks) of the stock’s own replay; C2 when the gate identifies a law; C3 when the visible peak is at least 3× the blind floor; C4 when ∣δ−0.5∣≤0.10\lvert\delta- 0.5\rvert\le0.10 and Y∈[0.5,1]Y \in[0.5, 1]; C5 when the end-over-peak is at or below that of the Obizhaeva–Wang (OW) kernel, the standard resilient book, on the same stock and schedule, with a non-positive slope and a free drift under 20 ticks, so the descent is not the drift; the OW row itself is left undecided. C4 and C5 are undecidable when no law is identified, and C3 when no blind run was made, so a missing measurement cannot read as a defect. Every verdict follows from the numbers printed beside it, so the whole ladder can be checked from Table 3 alone.

Table 3. All five stocks, one row per model, the same measurements everywhere (the AMD block is the one read band by band in Section 3). Columns: Par. = parameters; Ctx = conditioning window; LOB-Bench KS/L1/WS on free-generation rollouts against the real stream, 500-message windows, lower is better; Phase-1 flow balance (γfl\gamma_{\mathrm{fl}} = trade-sign memory, HH = diffusivity) and free drift (ticks); Phase-2 build-up (δ\delta = binned exponent, where the direct-L2L^2 profile identifies one; ±\pm = half-width of the 95% day-clustered bootstrap interval, the trading day being the resampling unit; YY = amplitude at the data edge; v/b = visible peak over blind floor, the C3 ratio); Phase-3 relaxation (e/p = end-over-peak; slp = post-execution slope in % of peak per execution duration). target rows: the stock’s real stream in identical windows; (exp) = the empirical value for real markets, from the literature. C1–C5 = the claim ladder of Figure 1, one verdict per claim (✓ pass, ✗ fail, · not decidable) on the criteria of Section 2: C1 the balance holds; C2 impact exists; C3 not book mechanics; C4 the square-root law; C5 the impact relaxes. The blind arm behind C3 runs for the neural panel only. Shaded bold: the two numbers behind the neural panel’s failed C4 and C5 – δ\delta against the 0.5 of the square-root law, e/p against the real-market 23\frac{2}{3} relaxation (the kernel rows bound this schedule) – the one signature all 25 neural cells repeat. Markers: “—” does not exist; n.i. = not identified; (⋅)u(\cdot)^u = below the identifiability or sample-size requirement, shown for reference only; c^c by construction; m^m duration-mixed; f^f fixed a priori; †^\dagger2k fine-tune at 4000; ‡^\ddaggerEA out-of-distribution.

ModelPar.CtxKSL1WSγfl\gamma_{\mathrm{fl}}HHdriftδ\deltaYYv/be/pslpC1–C5
AMD
target——lowlowlow1.660.54≈00.5 (exp)0.5 (exp)—23\frac{2}{3} (exp)∼−1.5 (exp)—
Historic——.060.162.0961.660.54+1(0.11)u^u(0.03)u^u—(−0.00)u^u(−0.5)u^u✓ ✗ · · ·
Heuristic2f2^f∞.060.162.0961.660.54+10.811.46—0.95−0.3c^c✓ ✓ · ✗ ✗
Propagator2f2^f∞.060.162.0961.660.54+10.760.98—0.89−0.5✓ ✓ · ✗ ✗
OW2f2^fexp..041.106.0701.660.54+10.730.96—0.81−0.3✓ ✓ · ✗ ·
CST1.5k0.328.523.570n.i.0.47+1n.i.n.i.—(0.68)u^u(−10.3)u^u· ✗ · · ·
NMZI1.5k+2EWMA.330.526.574n.i.0.270n.i.n.i.—(0.73)u^u(+3.6)u^u· ✗ · · ·
Hawkes0.4k≲1s.477.534.6442.230.20−3(0.48)u^u(0.03)u^u—(1.04)u^u(−1.9)u^u✗ ✗ · · ·
QR900.445.503.607.880.42+00.720.09—1.12+2.6✗ ✓ · ✗ ✗
S5-120M120M500.142.231.1851.900.55−180.66±.052.24211.19+0.6✓ ✓ ✓ ✗ ✗
S5-4k55M4k.171.270.2371.830.54+90.79±.064.00261.15+0.0✓ ✓ ✓ ✗ ✗
Mamba378M500.106.244.1441.200.58−690.87±.067.659.51.16m^m+0.4✓ ✓ ✓ ✗ ✗
Mamba3-4k78M4k†^\dagger.128.245.1651.060.58−2510.93±.058.385.01.36m^m+3.7✓ ✓ ✓ ✗ ✗
GDN94M500.139.250.183.790.49−1270.90±.058.57120.88m^m−2.4✓ ✓ ✓ ✗ ✗
NVDA
target——lowlowlow1.310.49≈00.5 (exp)0.5 (exp)—23\frac{2}{3} (exp)∼−1.5 (exp)—
Historic——.054.118.0681.310.49−1(−0.33)u^u(0.00)u^u—(−0.33)u^u(−0.3)u^u✓ ✗ · · ·
Heuristic2f2^f∞.054.118.0681.310.49−10.930.99—1.07+0.1c^c✓ ✓ · ✗ ✗
Propagator2f2^f∞.054.118.0681.310.49−10.840.66—1.04+0.1✓ ✓ · ✗ ✗
OW2f2^fexp..055.098.061.970.51+10.830.69—0.92+0.0✓ ✓ · ✗ ·
CST1.5k0.219.398.303.160.440n.i.n.i.—(0.64)u^u(−9.2)u^u✗ ✗ · · ·
NMZI1.5k+2EWMA.224.399.308−.120.380n.i.n.i.—(1.06)u^u(−1.0)u^u✗ ✗ · · ·
Hawkes0.4k≲1s.259.339.3451.710.20+2(1.05)u^u(0.65)u^u—(−3.00)u^u(−59.5)u^u✗ ✗ · · ·
QR900.258.349.363.830.35+10.880.16—2.47+20.8✗ ✓ · ✗ ✗
S5-120M120M500.098.163.1332.320.55−70.98±.057.36230.99−0.7✓ ✓ ✓ ✗ ✗
S5-4k55M4k.120.181.1581.940.54−40.97±.057.49231.110.6✓ ✓ ✓ ✗ ✗
Mamba378M500.095.172.1291.080.59−241.15±.0519.057.71.67+5.3✓ ✓ ✓ ✗ ✗
Mamba3-4k78M4k†^\dagger.113.184.1471.390.62−271.11±.0518.989.41.03−0.5✓ ✓ ✓ ✗ ✗
GDN94M500.093.181.1521.990.65−291.12±.0515.43130.89−1.5✓ ✓ ✓ ✗ ✗
GOOG
target——lowlowlow1.770.54≈00.5 (exp)0.5 (exp)—23\frac{2}{3} (exp)∼−1.5 (exp)—
Historic——.069.133.1181.770.540(−0.12)u^u(0.01)u^u—(0.00)u^u(−0.1)u^u✓ ✗ · · ·
Heuristic2f2^f∞.069.133.1181.770.5400.810.73—1.00−0.1c^c✓ ✓ · ✗ ✗
Propagator2f2^f∞.069.133.1181.770.5400.73u^u0.46u^u—0.95u^u−0.1u^u✓ ✓ · ✗ ✗
OW2f2^fexp..046.091.0771.200.54+10.72u^u0.47u^u—(0.92)u^u(−0.1)u^u✗ ✗ · · ·
CST1.5k0.316.501.613−.440.51+1n.i.n.i.—(1.84)u^u(+4.5)u^u✗ ✗ · · ·
NMZI1.5k+2EWMA.318.503.612.040.25−1n.i.n.i.—(1.04)u^u(+3.9)u^u✗ ✗ · · ·
Hawkes0.4k≲1s.408.461.6361.910.030(0.76)u^u(0.05)u^u—(−2.01)u^u(−34.6)u^u✗ ✗ · · ·
QR900.398.445.6171.110.360n.i.n.i.—1.68+5.9✗ ✗ · · ·
S5-120M120M500.124.201.2421.660.56−180.73±.061.70261.14+0.4✓ ✓ ✓ ✓ ✗
S5-4k55M4k.131.217.2321.920.55+10.75±.051.83231.16+0.9✓ ✓ ✓ ✓ ✗
Mamba378M500.117.224.1241.950.59+420.97±.106.2491.67+2.6✓ ✓ ✓ ✗ ✗
Mamba3-4k78M4k†^\dagger.133.233.181.970.59−8791.21±.1112.563.40.24−13.8✓ ✓ ✓ ✗ ✗
GDN94M500.134.222.263.790.54−851.11±.108.429.60.18−8.5✓ ✓ ✓ ✗ ✗
EA‡^\ddagger
target——lowlowlow1.310.47≈00.5 (exp)0.5 (exp)—23\frac{2}{3} (exp)∼−1.5 (exp)—
Historic——.049.113.1121.310.470(−0.52)u^u(0.00)u^u—(0.00)u^u(−0.5)u^u✓ ✗ · · ·
Heuristic2f2^f∞.049.113.1121.310.470(0.85)u^u(1.42)u^u—(1.01)u^u(−0.1)u^u✓ ✗ · · ·
Propagator2f2^f∞.049.113.1121.310.470(0.76)u^u(0.93)u^u—(0.97)u^u(−0.2)u^u✓ ✗ · · ·
OW2f2^fexp..045.097.0991.250.430(0.74)u^u(0.97)u^u—(0.82)u^u(−0.5)u^u✗ ✗ · · ·
CST1.5k0.211.356.372.370.44+1n.i.n.i.—(3.49)u^u(+16.6)u^u✗ ✗ · · ·
NMZI1.5k+2EWMA.214.358.3721.020.450n.i.n.i.—(5.43)u^u(+16.6)u^u✗ ✗ · · ·
Hawkes0.4k≲1s.312.382.4312.080.430(0.45)u^u(0.31)u^u—(0.80)u^u(+0.7)u^u✗ ✗ · · ·
QR900.302.374.419.230.4500.740.32—0.42−1.0✗ ✗ · ✓
S5-120M120M500.135.221.2241.680.57−30.84±.0612.23291.18n.i.✓ ✓ ✓ ✓ ✗
S5-4k55M4k.145.264.2751.620.56+41.05±.0619.18381.24+0.6✓ ✓ ✓ ✓ ✗
Mamba378M500.125.182.2032.030.59−41.10±.0749.52251.37+2.2✓ ✓ ✓ ✓ ✗
Mamba3-4k78M4k†^\dagger.112.179.2101.820.62−131.12±.0741.66201.14+0.1✓ ✓ ✓ ✓ ✗
GDN94M500.106.172.2022.110.57−61.06±.0743.54131.34+1.6✓ ✓ ✓ ✓ ✗
MSFT
target——lowlowlow1.510.55≈00.5 (exp)0.5 (exp)—23\frac{2}{3} (exp)∼−1.5 (exp)—
Historic——.066.149.1051.510.55+12(0.87)u^u(0.23)u^u—(0.01)u^u(−0.9)u^u✓ ✗ · · ·
Heuristic2f2^f∞.066.149.1051.510.55+120.841.29—0.89−0.3c^c✓ ✓ · ✗ ✗
Propagator2f2^f∞.066.149.1051.510.55+120.830.94—0.82−0.5✓ ✓ · ✗ ✗
OW2f2^fexp..050.100.0691.820.55−70.80n.i.—0.71−0.5✓ ✓ · ✗ ·
CST1.5k0.339.462.590.200.24−13n.i.n.i.—(1.75)u^u(+5.1)u^u✗ ✗ · · ·
NMZI1.5k+2EWMA.346.476.597n.i.0.170n.i.n.i.—(−2.30)u^u(−37.8)u^u✗ ✗ · · ·
Hawkes0.4k≲1s.384.446.5991.880.23+2n.i.n.i.—0.57−6.4✗ ✗ · · ·
QR900.369.429.582.880.50−10.71n.i.—1.44+4.6✗ ✗ · ✓
S5-120M120M500.214.283.3251.960.55−300.63±.113.07111.14+0.3✓ ✓ ✓ ✗ ✗
S5-4k55M4k.226.298.2771.390.59+180.69±.113.48181.21+0.5✓ ✓ ✓ ✗ ✗
Mamba378M500.163.282.2081.470.62−390.81±.117.608.81.19+0.2✓ ✓ ✓ ✗ ✗
Mamba3-4k78M4k†^\dagger.134.278.1601.820.60−620.86±.148.799.60.72−3.9✓ ✓ ✓ ✗ ✗
GDN94M500.178.276.2131.030.52−580.79±.128.28110.95−2.1✓ ✓ ✓ ✗ ✗

Models under test

The benchmark accepts any message-level generator; Table 1 lists the panel of models we test. The replay block spans no causal response (Historic, the negative control), permanent impact (Heuristic), and two kernels with the target physics written in: the Propagator, whose power-law decay to 23\frac{2}{3} is the positive control, and Obizhaeva–Wang (OW), with exponential resilience. The five neural generators carry a continuous hidden state across generated and injected messages, the mechanism through which relaxation could arise, and share one eight-name corpus including AMD, evaluation month held out. Book reconstruction and matching use the JAX-LOB engine [12]; every number comes from the one campaign per stock of § 2.

Data preparation

The injection protocol requires three calibration numbers per stock: the child size, the spacing between children, and the daily volume that normalises cumulative participation. All three are computed from LOBSTER message data for January 2026, the evaluation month, held out of model training.

As impact is measured relative to the stock’s own activity, the measurements are re-calibrated per name. We choose a participation target of η=10%\eta= 10\% of the market orders during execution; broker databases retain execution participation shares of 3–40% [3] and the empirical impact surface is fitted over 10−410^{-4} to 0.1 [34]. The child volume is the stock’s median market-order size, VV is the day’s volume, and the spacing follows from the participation identity η=1/(1+ΔNϕ)\eta= 1/(1 + \Delta_N \phi):

ΔN=η−1−1ϕ=9ϕ,(3)\Delta_N = \frac{\eta^{-1}-1}{\phi} = \frac{9}{\phi}, \tag*{(3)}

computed per day from one month of LOBSTER message data [20]. Here ϕ\phi is the market-order share of the day’s message stream (Figure 3, middle). The child count N=100N = 100 is fixed a priori, never per model: the mean metaorder length in the empirical samples (96–98 trades per hidden order [24], 73–100 child orders [3]), spanning two decades of cumulative participation. A shorter metaorder would sample only the early, steepest part and bias δ\delta upward.

Three histograms showing median market-order size, market-order fraction, and generated messages between children

Figure 3. The universe and the calibration it fixes (day-mean over 487 names, January 2026). Left: the median market-order size, which sets the child volume. Middle: the market-order fraction of the message stream, the denominator of Eq. (3). Right: the resulting ΔN\Delta_N, the messages the generator must produce between children at η=10%\eta= 10\%; shaded bands are the OTR cohorts, vertical lines the universe median and the five selected stocks. Since ΔN\Delta_N is the generation burden of the same experiment, the five span the universe minimum (EA), the modal band (NVDA, MSFT), the high-OTR cohort (AMD) and its tail (GOOG).

Figure 3 shows the universe: ΔN\Delta_N is strongly right-skewed, so a high-OTR name (order-to-trade ratio 1/ϕ1/\phi) costs seven times more generation than a low-OTR one. Table 2 takes one name per cohort. This paper reports AMD band by band: high-OTR cohort (ΔN=401±69\Delta_N = 401 \pm69, ≈\approx40k messages per metaorder), and inside every training corpus, so the measurement carries no distribution shift.

Results

Table 3 gives every measurement for the 13 models on all five stocks. On every stock the neural generators produce an impact law of their own, but it is not the square-root law, and it does not relax. Below we go through the AMD measurements (Figure 4) phase by phase; § 4 interprets them.

The AMD measurements, all three phases in one figure

Figure 4. The AMD measurements, all three phases in one figure (5×25 \times2). Top, Phase 1: pseudo-metaorders on the no-injection arm (the pipeline returns drift, not impact); the trade-sign autocorrelation; the mid-displacement variance (slope = 2H2H); the drift-corrected own-trade response R(ℓ)R(\ell). Middle, Phase 2: antisymmetrised I(k)I(k) against the ⋅\sqrt{\mathord{\cdot}}-law reference (full range inset), the master curve, and the binned estimator along the metaorder (δ(k)\delta(k) and Y(k)Y(k), both against 0.5). Bottom, Phase 3: I(k)I(k) past the end of execution, and the master curve against the theoretical reference (dashed: v\sqrt{v} build-up, then power-law decay to 23\frac{2}{3}). Apart from GDN’s drift, only the curves with resilience typed in come down.

Phase 1: Free generation

In identical windows, the real AMD stream is balanced: persistent trade signs (γflow=1.66\gamma_{\mathrm{flow}} = 1.66) with a diffusive mid-price (H=0.54H = 0.54). No generator holds both legs. The Mamba family carries longer flow memory than the real stream (γflow=1.20\gamma_{\mathrm{flow}} = 1.20 and 1.06) and a price that is too diffusive (H=0.58H = 0.58 for both): persistence left uncompensated. The S5 family carries shorter flow memory (1.90, 1.83) with the real diffusivity (H=0.55H = 0.55, 0.54); GDN carries the panel’s longest flow memory (0.79) with a price below diffusive (H=0.49H = 0.49). Every neural generator also drifts when left alone, from +9 (S5-4k) to −251 (Mamba3-4k) ticks per rollout (Table 3). Every neural generator therefore fails C1.

Phase 2: Metaorder response

The middle band of Figure 4 shows the build-up. We first check that a law exists, then measure it. All five neural generators show a sharp minimum of the L2L_2 misfit over δ\delta (§ 2), so their exponent is identified: claim C2 passes across the panel. For the Historic replay the misfit is flat and the amplitude sits at zero: with no signal, no δ\delta fits better than another, so there is no law, the correct answer for a stream that cannot react.

Where a law is identified, we calculate δ\delta. On AMD the binned exponents are 0.66 (S5-120M), 0.79 (S5-4k), 0.87 (Mamba3), 0.90 (GDN), and 0.93 (Mamba3-4k). Their 95% day-clustered bootstrap intervals are ±\pm0.05–0.06: the S5 family stays closest to 0.5, yet no interval comes near it. The band is stable under every estimator variant of Section 2, and the estimator’s bias points down: the true build-up is, if anything, steeper.

The amplitude turns the overshoot into money: the neural panel shows Y=2.2Y = 2.2–8.6 against the empirical Y≈0.5Y \approx0.5, four to seventeen times what a real metaorder pays per unit of participation. In levels, a 100-child metaorder moves the simulated price by 17–70 bps,

against at most 11 bps for any baseline (the Heuristic replay). On AMD, claim C4 fails in every neural cell: no exponent within 0.10 of 0.5, no amplitude inside the empirical band.

The baselines behave as designed. The three replay kernels (Heuristic, Propagator, OW) are identified at δ=0.73\delta= 0.73–0.810.81 with Y=0.96Y = 0.96–1.461.46: the mechanical response written into them, at roughly the price a real book charges. Their δ\delta sits below the closed-form values (≈0.9\approx0.9–1.01.0) by the small-amplitude bias measured in the planted-law calibration. QR is identified at δ=0.72\delta= 0.72 with Y=0.09Y = 0.09, a law with almost no impact behind it; the zero-intelligence pair (CST, NMZI) and Hawkes identify nothing at all (Y=0.03Y = 0.03 for Hawkes on AMD, below the floor). The neural models differ from the baselines in amplitude: their exponents overlap with the replay kernels’, but their YY exceeds every baseline’s. The blind control shows that this impact is the models’ own (C3): the visible peak is at least 3× the blind floor in all 25 neural cells and over 10× in 16 (v/b, Table 3). This excess is the indirect impact the experiments were designed to isolate.

Phase 3: Relaxation

The bottom band asks whether impact comes down once execution stops. Real metaorders fall to about two-thirds of peak within one to two execution durations and to about one-half within ten [6, 9, 24], the span of our window, so a flat curve cannot be blamed on it. The kernel baselines set the scale: at realistic child spacing, a kernel spends most of its transient between children, so its closed-form end-over-peak is 0.94 for the Propagator and 0.87 for OW, and the measured values land beside these (0.89 and 0.81 on AMD, against the permanent Heuristic’s 0.95).

The neural panel shows no credible relaxation. End-over-peak on AMD reads 1.19 (S5-120M), 1.15 (S5-4k), 1.16 (Mamba3), 1.36 (Mamba3-4k), and 0.88 (GDN), with post-execution slopes of +0.6, ±0.0, +0.4, +3.7, and −2.4% of the peak per execution duration. Four of the five remain above peak: the price keeps moving in the metaorder’s direction after the last child has executed. GDN falls below peak, but its free drift of −127 ticks prevents attributing the decline to resilience. That is claim C5, and no neural cell passes it.

Extending to a larger universe

The AMD portrait replicates down the blocks of Table 3: the neural panel is one claim-ladder signature repeated 25 times: C1 fails, C2 and C3 pass, C4 and C5 fail.

All five neural generators identify a law on every stock, every exponent above the square-root reference: 0.63–0.93 on AMD and MSFT, 0.73–1.21 on GOOG, 0.97–1.15 on NVDA, 0.84–1.12 on EA. All 25 day-clustered intervals (the ± of Table 3) exclude 0.5, with half-widths of 0.04–0.14 and the tightest case (S5-120M) still bounding its exponent above 0.53. The replay returns no law on any stock, keeping the estimator honest. Ranking the generators by δ\delta or by YY gives nearly the same order on every stock (Kendall W=0.82W = 0.82 and 0.81): the benchmark measures a model-specific component that persists across stocks.

In 20 of the 25 neural rows, HH exceeds the stock’s own value; in three it matches, and only GDN, on AMD and MSFT, sits below. No neural row reaches two thirds by decay: the three lowest end-over-peak entries (GDN 0.18 and Mamba3-4k 0.24 on GOOG; Mamba3-4k 0.72 on MSFT) sit on the heaviest-drift rows of their blocks; the descent is drift, not resilience.

On the four stocks in the training corpus, Y≈2Y \approx2–99 on AMD and MSFT, 1.7–12.6 on GOOG and 7–19 on NVDA. On EA, the one stock outside the corpus, Y=12Y = 12–50. The observed OOD result does not destroy the law; it destroys its calibration.

The Propagator and OW are identified on AMD, NVDA and MSFT but not on GOOG or EA; QR’s end-over-peak swings from 2.47 (NVDA) to 0.42 (EA).

The three 500-context generators sit close together in the distributional columns yet differ materially in impact. Across stocks, the correlation between the LOB–Bench KS ranking and the ∣δ−0.5∣|\delta- 0.5| ranking is unstable (+0.54 on GOOG against −0.71 on MSFT, p=0.02p = 0.02) and mostly negative within the neural family (MSFT neural rows: −0.90, p=0.08p = 0.08). The better mimic can sit farther from the impact law, so the two properties must be measured separately.

Discussion

Our results separate three questions that distributional evaluation conflates: whether impact exists, whether it is the generator’s own, and whether its dynamics are market-realistic; across the neural panel, the answer is yes, yes, and no. The joint C4/C5 failure is consistent with insufficient replenishment: in a real book, each child’s push decays before the next arrives, turning NN pushes into N\sqrt{N} rather than NN. With persistent flow but insufficient replenishment, impact instead builds up too steeply and fails to relax credibly (§ 3.1–§ 3.3). The blind control shows that the build-up is not explained by book mechanics alone; the defect hides at the single-event scale. We attribute the missing replenishment to limited long-horizon memory: relaxation requires retaining a reference price from before the metaorder, which the models’ still-short context windows do not preserve.

These impact errors matter directly for execution: an execution cost model depends on the shape, amplitude, and relaxation of market impact [15, 23], all measured here per model and stock. Today’s generators may achieve message-level realism, but they remain unsuitable as environments for execution agents while the endogenous impact they do not reproduce has the wrong shape and does not decay: such a simulator can reward schedules that a real book would punish.

The results suggest how to improve these models. At each training checkpoint, Phase 1 can be run on freely generated rollouts: the goal is for the generated γflow\gamma_{\mathrm{flow}} and HH to approach their empirical values for the stock. The direction matters: learn replenishment rather than unlearn persistence; killing flow memory would restore the balance vacuously. Phases 2 and 3 then test whether the repair restores realistic build-up and relaxation. The 4k-context variants fail the same tests but remain well short of a metaorder, leaving the attribution untested rather than refuted; longer contexts and larger models are the natural next test.

Limitations. One stock is reported band by band, the other four only through Table 3, and everything is measured at one operating point: one participation rate, one child size, aggressive children [21, 30], one metaorder shape, one month of one exchange; and δ\delta depends on that point. The 10% target lies inside the retained empirical samples [3, 34]; the extreme-volume regime [8] is not probed. The month itself is a sample: a month atypical by about one within-month standard deviation would already move the exponent past its half-width cap.

One open-source package (repository https://github.com/george-nigmatulin/lob-impact) contains the protocol, calibration, estimators, controls, and reporting rules; a user supplies a model and one month of LOBSTER-format data for any stock.

Conclusion

Market impact emerges in generative LOB models. Five neural message generators, trained only on next-token prediction, answer an injected metaorder with an identifiable law in all 25 model–stock pairs, while a replay that cannot react does not answer at all. The models fail in two related ways: impact builds up more steeply than the square-root reference and shows no credible post-execution relaxation. Together, these failures point to insufficient replenishment to compensate persistent order flow. We tentatively attribute both to limited long-horizon memory, induced by still-short context windows, a concrete target for future models.

Acknowledgments

This work was supported by the UKRI ESRC Grand Union DTP [ES/Y001761/1]; EPSRC [UKRI5149] and other sponsors of BOLD; the Department of Computer Science, University of Oxford; and a UKRI AI World Leading Researcher Fellowship [EP/W002949/1]. The authors acknowledge the use of resources provided by the Isambard-AI National AI Research Resource (AIRR) [22]. Isambard-AI is operated by the University of Bristol and is funded by the UK Government’s Department for Business, Innovation, Science and Trade (DBIST) via UK Research and Innovation; and the Science and Technology Facilities Council [ST/AIRR/I-A-I/1023].

References

References

  1. [1]Robert Almgren, Chee Thum, Emmanuel Hauptmann, and Hong Li. 2005. Direct Estimation of Equity Market Impact. Risk 18, 7 (2005), 58–62.
  2. [2]Alfred Backhouse, Kang Li, Jakob Foerster, Anisoa­ra Calinescu, and Stefan Zohren. 2025. Painting the Market: Generative Diffusion Models for Financial Limit Order Book Simulation and Forecasting. arXiv preprint arXiv:2509.05107 (2025).arxiv.org/abs/2509.05107
  3. [3]Emmanuel Bacry, Adrian Iuga, Matthieu Diffusion Foerster, and Charles-Albert Lehalle. 2015. Market impacts and the life cycle of investors orders. Market Microstructure and Liquidity 1, 02 (2015), 1550009.
  4. [4]Emmanuel Bacry, Iacopo Mastromatteo, and Jean-François Muzy. 2015. Hawkes Processes in Finance. Market Microstructure and Liquidity 1, 1 (2015), 1550005.
  5. [5]Hamza Bodor and Laurent Carlier. 2025. Deep Learning Meets Queue-Reactive: a Framework for Realistic Limit Order Book Simulation. arXiv preprint arXiv:2501.08822 (2025).arxiv.org/abs/2501.08822
  6. [6]Jean-Philippe Bouchaud, Julius Bonart, Jonathan Donier, and Martin Gould. 2018. Trades, quotes and prices: financial markets under the microscope. Cambridge University Press, Cambridge, UK.
  7. [7]Jean-Philippe Bouchaud, Yuval Gefen, Marc Potters, and Matthieu Wyart. 2004. Fluctuations and response in financial markets: the subtle nature of ‘random’ price changes. Quantitative Finance 4, 2 (2004), 176–190.
  8. [8]Frédéric Bucci, Michael Benzaquen, Fabrizio Lillo, and Jean-Philippe Bouchaud. 2019. Crossover from Linear to Square-Root Market Impact. Physical Review Letters 122, 10 (2019), 108302.DOI
  9. [9]Frédéric Bucci, Michael Benzaquen, Fabrizio Lillo, and Jean-Philippe Bouchaud. 2019. Slow Decay of Impact in Equity Markets: Insights from the ANcerno Database. Market Microstructure and Liquidity 4, 03n04 (2019), 1950006.arxiv.org/abs/1901.05332
  10. [10]Andrea Coletta, Matteo Prata, Michele Conti, Emanuele Mercanti, Novella Bartolini, Américo Moulin, Svitlana Vyetrnenko, and Tucker Balch. 2021. Towards Realistic Market Simulations: a Generative Adversarial Networks Approach. In Proceedings of the 2nd ACM International Conference on AI in Finance (ICAIF). ACM, New York, NY, USA, 1–9.arxiv.org/abs/2110.13287
  11. [11]Rama Cont, Sasha Stoikov, and Rishi Talreja. 2010. A Stochastic Model for Order Book Dynamics. Operations Research 58, 3 (2010), 549–563.
  12. [12]Sascha Frey, Kang Li, Peer Nagy, Silvia Sapora, Chris Lu, Stefan Zohren, Jakob Foerster, and Anisoara Calinescu. 2023. JAX-LOB: A GPU-Accelerated Limit Order Book Simulator to Unlock Large Scale Reinforcement Learning for Trading. In Proceedings of the 4th ACM International Conference on AI in Finance (ICAIF). ACM, New York, NY, USA, 583–591.arxiv.org/abs/2308.13289
  13. [13]Alberta Guéant, 2010. No-Dynamic-Arbitrage and Market Impact. Quantitative Finance 10, 7 (2010), 749–759.
  14. [14]Alberta Gu and Tri Dao. 2024. Mamba: Linear-Time Sequence Modeling with Selective State Spaces. In First Conference on Language Modeling (COLM). Open-Review.net, Philadelphia, PA, USA.arxiv.org/abs/2312.00752
  15. [15]Olivier Guéant. 2016. The Financial Mathematics of Market Liquidity: From Optimal Execution to Market Making. CRC Press, Boca Raton, FL.
  16. [16]Weibing Huang, Charles-Albert Lehalle, and Mathieu Rosenbaum. 2015. Simulating and Analyzing Order Book Data: The Queue-Reactive Model. J. Amer. Statist. Assoc. 110, 509 (2015), 107–122.arxiv.org/abs/1312.0563
  17. [17]Aakash Lahoti, Kevin Y. Li, Berlin Chen, Caitlin Wang, Aviv Bick, J. Zico Kolter, Tri Dao, and Albert Gu. 2026. Mamba-3: Improved Sequence Modeling using State Space Principles. In Proceedings of the 14th International Conference on Learning Representations (ICLR). OpenReview.net, Rio de Janeiro, Brazil.arxiv.org/abs/2603.15569
  18. [18]Junjie Li, Yang Liu, Weiqing Liu, Shikai Fang, Lewen Wang, Chang Xu, and Jiang Bian. 2025. Financial Market Simulation Engine Powered by Generative Foundation Model. In Proceedings of the 13th International Conference on Learning Representations (ICLR). OpenReview.net, Singapore.arxiv.org/abs/2409.07486
  19. [19]Fabrizio Lillo and J. Doyne Farmer. 2004. The long memory of the efficient market. Studies in Nonlinear Dynamics & Econometrics 8, 3 (2004).arxiv.org/abs/cond-mat/0311053
  20. [20]LOBSTER. 2023. LOBSTER: Limit Order Book System – The Efficient Reconstructor. Retrieved January 15, 2025 from https://lobsterdata.com
  21. [21]Guillaume Maitrier, Grégoire Loep­er, Kiyoshi Kanazawa, and Jean-Philippe Bouchaud. 2026. The “double” square-root law: Evidence for the mechanical origin of market impact using Tokyo Stock Exchange data. Quantitative Finance 26, 4 (2026), 491–503.
  22. [22]Simon McIntosh-Smith, Sadaf R Alam, and Christopher Woods. 2024. Isambard-AI: a leadership class supercomputer optimised specifically for Artificial Intelligence. arXiv:2410.11199 [cs.DC] https://arxiv.org/abs/2410.11199
  23. [23]Valentin Mohl, Sascha Frey, Reuben Leyland, Kang Li, George Nigmatulin, Mihai Cucuringu, Stefan Zohren, Jakob Foerster, and Anisoara Calinescu. 2025. JaxMARL-FFT: GPU-Accelerated Large-Scale Multi-Agent Reinforcement Learning for High-Frequency Trading. In Proceedings of the 6th ACM International Conference on AI in Finance (ICAIF). ACM, New York, NY, USA, 18–26.DOI
  24. [24]Esteban Moro, Javier Vicente, Luis G. Moyano, Austin Gerig, J. Doyne Farmer, Gabriella Vaglica, Fabrizio Lillo, and Rosario N. Mantegna. 2009. Market impact and trading profile of hidden orders in stock markets. Physical Review E 80, 6 (2009), 066102.
  25. [25]Peer Nagy, Sascha Frey, Kang Li, Bidipta Sarkar, Svitlana Vyetrnenko, Stefan Zohren, Anisoara Calinescu, and Jakob Foerster. 2025. LOB-Bench: Benchmarking Generative AI for Finance – an Application to Limit Order Book Data. In Proceedings of the 42nd International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 267). PMLR, Vancouver, Canada, 45437–45460.arxiv.org/abs/2502.09172
  26. [26]Peer Nagy, Sascha Frey, Silvia Sapora, Kang Li, Anisoara Calinescu, Stefan Zohren, and Jakob Foerster. 2023. Generative AI for End-to-End Limit Order Book Modelling: A Token-Level Autoregressive Generative Model of Message Flow Using a Deep State Space Network. In Proceedings of the 4th ACM International Conference on AI in Finance (ICAIF). ACM, New York, NY, USA, 91–99.arxiv.org/abs/2309.00638
  27. [27]Anna A Obizhaeva and Jiang Wang. 2013. Optimal trading strategy and supply/demand dynamics. Journal of Financial Markets 16, 1 (2013), 1–32.
  28. [28]Michael Parkinson. 1980. The Extreme Value Method for Estimating the Variance of the Rate of Return. The Journal of Business 53, 1 (1980), 61–65.DOI
  29. [29]Adele Ravagnani and Fabrizio Lillo. 2026. Modeling metaorder impact with a Non-Markovian Zero Intelligence model. Physica A: Statistical Mechanics and its Applications 681 (2026), 131056.
  30. [30]Yuki Sato and Kiyoshi Kanazawa. 2025. Strict Universality of the Square-Root Law in Price Impact across Stocks: a Complete Survey of the Tokyo Stock Exchange. Physical Review Letters 135, 25 (2025), 257401.
  31. [31]Jimmy T.H. Smith, Andrew Warrington, and Scott W. Linderman. 2023. Simplified State Space Layers for Sequence Modeling. In Proceedings of the 11th International Conference on Learning Representations (ICLR). OpenReview.net, Kigali, Rwanda.arxiv.org/abs/2208.04933
  32. [32]Bence Tóth, Yves Lempérière, Cyril Deremble, Joachim de Lataillade, Julien Kockelkoren, and Jean-Philippe Bouchaud. 2011. Anomalous Price Impact and the Critical Nature of Liquidity in Financial Markets. Physical Review X 1, 2 (2011), 021006.
  33. [33]Songlin Yang, Jan Kautz, and Ali Hatamizadeh. 2025. Gated Delta Networks: Improving Mamba2 with Delta Rule. In Proceedings of the 13th International Conference on Learning Representations (ICLR). OpenReview.net, Singapore.arxiv.org/abs/2412.06464
  34. [34]Elia Zarinelli, Michele Treccani, J. Doyne Farmer, and Fabrizio Lillo. 2015. Beyond the square root: Evidence for logarithmic dependence of market impact on size and participation rate. Market Microstructure and Liquidity 1, 02 (2015), 1550004.arxiv.org/abs/1412.2152

Paper details

vlnc:W_ar5nxgt6
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Economics, Econometrics and Finance

Not recorded for this paper · View statement →

Looking for related papers…
Contents