Researchers simulate and estimate a market model with a matching engine to understand its impact on order submission and management.
problem The impact of a matching engine on the modeling of order submission and management in financial markets.
method Simulation of a 10-variate Hawkes process with rules for different order types, including limit orders, to compare model parameters with the original order generating process.
result Practical considerations, not directly related to model specification, can significantly distort the true model specification in an asynchronous trading environment.
Peer grading is the process of students reviewing each others' work, such as homework submissions, and has lately become a popular mechanism used in massive open online courses (MOOCs). Intrigued by this idea, we used it in a course on algorithms and data structures at the University of Hamburg. Throughout the whole se…
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.
We propose a limit order book (LOB) model with dynamics that account for both the impact of the most recent order and the shape of the LOB. We present an empirical analysis showing that the type of the last order significantly alters the submission rate of immediate future orders, even after accounting for the state of…
AlgoPerf competition evaluates neural network training speed-ups.
problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.
Order submission and cancellation are two constituent actions of stock trading behaviors in order-driven markets. Order submission dynamics has been extensively studied for different markets, while order cancellation dynamics is less understood. There are two positions associated with a cancellation, that is, the price…
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.
This paper has been withdrawn in order to replace it by two separate submissions: 1. Hamiltonian 2-forms in Kahler geometry III: Extremal metrics and stability, math.DG/0511118; 2. Hamiltonian 2-forms in Kahler geometry IV: Weakly Bochner-flat Kahler manifolds, math.DG/0511119. As the titles indicate, the first paper c…
Study on heavy tails in closing auction returns, explaining imbalance through limit order submission.
problem Understanding heavy tails in closing auction return distributions.
method Used the stochastic call auction model of Derksen et al. (2020a) to derive and verify a relation between tail exponents.
result Large closing price fluctuations are not caused by large market orders, but by imbalance in limit orders.
Machine-learning (ML) hardware and software system demand is burgeoning. Driven by ML applications, the number of different ML inference systems has exploded. Over 100 organizations are building ML inference chips, and the systems that incorporate existing models span at least three orders of magnitude in power consump…
Price changes are induced by aggressive market orders in stock market. We introduce a bivariate marked Hawkes process to model aggressive market order arrivals at the microstructural level. The order arrival intensity is marked by an exogenous part and two endogenous processes reflecting the self-excitation and cross-e…
In this paper I empirically investigate prediction markets for binary options. Advocates of prediction markets have suggested that asset prices are consistent estimators of the "true" probability of a state of the world being realized. I test whether the market reaches a "consensus." I find little evidence for converge…
This work introduces a new benchmark to compare neural network training algorithms.
problem Lack of reliable benchmarks to compare training algorithms effectively.
method Developed a new benchmark called AlgoPerf: Training Algorithms benchmark.
result Demonstrated the feasibility of the benchmark and set a provisional state-of-the-art.
Submission was withdrawn by authors. arXiv:math/0305140
this is a duplicate submission(original is arXiv:1612.02141). Hence want to withdraw it
The article describes our submission to SemEval 2019 Task 8 on Fact-Checking in Community Forums. The systems under discussion participated in Subtask A: decide whether a question asks for factual information, opinion/advice or is just socializing. Our primary submission was ranked as the second one among all participa…
This submission has been withdrawn by the author and superseded by arXiv:0804.0744.
The principle of peer review is central to the evaluation of research, by ensuring that only high-quality items are funded or published. But peer review has also received criticism, as the selection of reviewers may introduce biases in the system. In 2014, the organizers of the ``Neural Information Processing Systems\r…
Section 1.3 was incorrect, and 2.1 will be removed from further submissions. A rewritten version will be posted in the future.
There is a technical issue in the analysis that is not easily fixable. We, therefore, withdraw the submission. Sorry for the inconvenience.
Sparse DNNs face scalability issues; MIT/IEEE/Amazon challenge analyzes best solutions.
problem Scalability issues in Sparse Deep Neural Networks (DNNs).
method Mathematically defined DNN inference computation, community submissions from various fields.
result Sparse DNN execution time, TmDNN, is strongly dependent on the number of operations, Nmop. This version withdrawn by arXiv administrators because the submitter did not have the right to agree to our license at the time of submission.
Study adapts liquidity model to equity auctions, revealing accelerated event rates and reduced price impact.
problem Understanding and predicting price dynamics in equity auctions.
method Adapted latent/revealed order book framework to equity auctions, measuring order submissions, cancellations, and diffusion rates.
result Equity auctions exhibit accelerated event rates leading to reduced price impact and decreased volatility.
Study shows how macroeconomic news affects intraday price and order flow dynamics.
problem Understanding how macroeconomic news impacts intraday price and order flow dynamics.
method Structural VAR model identified through heteroskedasticity, estimated at one-second frequency for each 15-minute interval.
result Macroeconomic news announcements reshape price-flow dynamics, with significant impacts on price and flow impacts at the one-second horizon.
Long-range correlation in financial time series reflects the complex dynamics of the stock markets driven by algorithms and human decisions. Our analysis exploits ultra-high frequency order book data from NASDAQ Nordic over a period of three years to numerically estimate the power-law scaling exponents using detrended …
This article contains detailed proofs and additional examples related to the UAI-2013 submission `Learning Sparse Causal Models is not NP-hard'. It describes the FCI+ algorithm: a method for sound and complete causal model discovery in the presence of latent confounders and/or selection bias, that has worst case polyno…
System tackles indeterminacies in automated audio captioning.
problem Word selection and sentence length indeterminacies in automated audio captioning.
method Solves caption generation and sub-indeterminacy problems through multi-task learning to estimate keywords and sentence length.
result Model achieved 20.7 SPIDEr score, significantly outperforming baseline.
We present SemEval-2019 Task 8 on Fact Checking in Community Question Answering Forums, which features two subtasks. Subtask A is about deciding whether a question asks for factual information vs. an opinion/advice vs. just socializing. Subtask B asks to predict whether an answer to a factual question is true, false or…
We investigate the behavior of limit order books on the meso-scale motivated by order execution scheduling algorithms. To do so we carry out empirical analysis of the order flows from market and limit order submissions, aggregated from tick-by-tick data via volume-based bucketing, as well as various LOB depth and shape…
This volume represents the accepted submissions from the Machine Learning for Health (ML4H) workshop at the conference on Neural Information Processing Systems (NeurIPS) 2018, held on December 8, 2018 in Montreal, Canada.
We here summarize our experience running a challenge with open data for musical genre recognition. Those notes motivate the task and the challenge design, show some statistics about the submissions, and present the results.
This paper is a revised version of a previously posted paper in arxiv. The authors posted it as a new submission by mistake. The latest version of the paper can be found at arXiv:math-ph/0512003v2
The order submission and cancelation processes are two crucial aspects in the price formation of stocks traded in order-driven markets. We investigate the dynamics of order cancelation by studying the statistical properties of inter-cancelation durations defined as the waiting times between consecutive order cancelatio…
In this paper we develop a model of an order-driven market where traders set bids and asks and post market or limit orders according to exogenously fixed rules. Agents are assumed to have three components to the expectation of future asset returns, namely-fundamentalist, chartist and noise trader. Furthermore agents di…
We describe the submission of the Quo Vadis team to the Traffic4cast competition, which was organized as part of the NeurIPS 2019 series of challenges. Our system consists of a temporal regression module, implemented as 1×1 2d convolutions, augmented with spatio-temporal biases. We have found that using biases i…
This study presents an agent-based computational cross-market model for Chinese equity market structure, which includes both stocks and CSI 300 index futures. In this model, we design several stocks and one index futures to simulate this structure. This model allows heterogeneous investors to make investment decisions …
In order-driven markets, limit-order book (LOB) resiliency is an important microscopic indicator of market quality when the order book is hit by a liquidity shock and plays an essential role in the design of optimal submission strategies of large orders. However, the evolutionary behavior of LOB resilience around liqui…
Due to space limitations, our submission "Source Separation and Clustering of Phase-Locked Subspaces", accepted for publication on the IEEE Transactions on Neural Networks in 2011, presented some results without proof. Those proofs are provided in this paper.
We corrected a few errors in the previous submission. These do not affect any of the topological conclusions of the earlier version. We have also included a few observations about the Casson invariant of the Brieskorn homology spheres.
Framework reconstructs missing spatio-temporal data for extreme value prediction.
problem Predicting extreme values from incomplete spatio-temporal data.
method Convolutional deep neural networks and autoencoder-like models for conditional sampling.
result Framework produces accurate reconstructions of missing data for extremal values.
Neural Information Processing Systems (NIPS) is a top-tier annual conference in machine learning. The 2016 edition of the conference comprised more than 2,400 paper submissions, 3,000 reviewers, and 8,000 attendees. This represents a growth of nearly 40% in terms of submissions, 96% in terms of reviewers, and over 100%…
Collectives can manipulate learning platforms by coordinated data submission, requiring strategic assessments and algorithms.
problem Collectives can influence learning platforms by altering data, posing risks and requiring strategic planning.
method Developed a theoretical and algorithmic framework to understand and mitigate collective manipulation of learning platforms.
result Demonstrated the need for strategic assessments and implementable coordination algorithms to prevent collective manipulation.
This paper describes FBK's submission to the end-to-end English-German speech translation task at IWSLT 2018. Our system relies on a state-of-the-art model based on LSTMs and CNNs, where the CNNs are used to reduce the temporal dimension of the audio input, which is in general much higher than machine translation input…
Mitigates bias in evaluations by considering known outcome information.
problem Bias in evaluations due to external factors like grades or acceptance.
method Formulates bias as a partial ordering, solves regularized optimization problem.
result The debiasing method improves evaluation accuracy by adapting regularization.
This paper describes audEERING's submissions as well as additional evaluations for the One-Minute-Gradual (OMG) emotion recognition challenge. We provide the results for audio and video processing on subject (in)dependent evaluations. On the provided Development set, we achieved 0.343 Concordance Correlation Coefficien…
Private cancer prediction model trained on federated genomic data.
problem Train a private cancer prediction model on federated genomic data.
method Differentially private federated learning (FL) for genomic cancer prediction.
result Ranked 3rd in a competition for private cancer prediction.
This document investigates the integration of adaptive distinguishing sequences into the process of active automata learning (AAL). A novel AAL algorithm "ADT" (adaptive discrimination tree) is developed and presented. Since the submission of the original thesis, the presented algorithm has been integrated into LearnLi…
New framework promotes reproducible, domain-agnostic reinforcement learning algorithms.
problem Domain-specific, compute-resource-maximizing, and non-reproducible participant solutions in reinforcement learning competitions.
method Submission retraining, domain randomization, desemantization through domain obfuscation, and compute/environment-sample budget limitation.
result Participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient.