mlsanityData to 14 Oct 2026

Detecting Toxic Flow

arXiv 2312.05827 ↗First posted 10 Dec 2023q-fin.TR cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper develops a framework to predict toxic trades that a broker receives from her clients. Toxic trades are predicted with a novel online learning Bayesian method which we call the projection-based unification of last-layer and subspace estimation (PULSE). PULSE is a fast and statistically-efficient Bayesian procedure for online training of neural networks. We employ a proprietary dataset of foreign exchange transactions to test our methodology. Neural networks trained with PULSE outperform standard machine learning and statistical methods when predicting if a trade will be toxic; the benchmark methods are logistic regression, random forests, and a recursively-updated maximum-likelihood estimator. We devise a strategy for the broker who uses toxicity predictions to internalise or to externalise each trade received from her clients. Our methodology can be implemented in real-time because it takes less than one millisecond to update parameters and make a prediction. Compared with the benchmarks, online learning of a neural network with PULSE attains the highest PnL and avoids the most losses by externalising toxic trades.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 9 of its 37 references that are in the map. First posted on arXiv 10 Dec 2023.

Builds on

9 of 37 references.

References · 9

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  3. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
  4. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  5. 2022Do Bayesian Neural Networks Need To Be Fully Stochastic?cited by 63
  6. 2021How many degrees of freedom do we need to train deep networks: a loss landscape perspectivecited by 28
  7. 2017Online Natural Gradient as a Kalman Filtercited by 25
  8. 2019Stein's Lemma for the Reparameterization Trick with Exponential Family Mixturescited by 18
  9. 2021Efficient Online Bayesian Inference for Neural Banditscited by 15

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.