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

Trend · papers per month

125251376501 · Jun 202019922001200920172026
48 results for order sizes

Negative step sizes improve second-order methods for neural networks.

problem Second-order methods discard negative curvature, limiting their effectiveness.
method Introduce negative step sizes in second-order methods combined with Wolfe line search.
result Negative step sizes lead to global convergence and improved performance.

SGD's performance improves with critical batch size, minimizing SFO complexity.

problem Optimizing SGD's performance with batch size and learning rate.
method Analysis of SGD using constant and decaying learning rates, focusing on batch size effects.
result SGD with critical batch size minimizes SFO complexity.

A novel Hawkes Process model captures order sizes in LOBs, improving fit quality and market impact studies.

problem Capturing the variability in order sizes in Limit Order Books (LOBs).
method Compound Hawkes Process with time-varying parameters and non-parametric calibration.
result Improved fit quality and empirical market impact function replication.

We study the statistical regularities of opening call auction using the ultra-high-frequency data of 22 liquid stocks traded on the Shenzhen Stock Exchange in 2003. The distribution of the relative price, defined as the relative difference between the order price in opening call auction and the closing price of last tr…

2009-05-05abs ↗pdf ↗

Improved robustness in optimization methods using second-order information.

problem Scalability and sensitivity to mini-batch size in optimization methods.
method Mini-Batch Stochastic Variance-Reduced Newton (extttMbSVRN exttt{Mb-SVRN}) algorithm incorporating partial second-order information.
result Achieves a fast linear convergence rate independent of mini-batch size for large data sizes.

We provide an empirical investigation aimed at uncovering the statistical properties of intricate stock trading networks based on the order flow data of a highly liquid stock (Shenzhen Development Bank) listed on Shenzhen Stock Exchange during the whole year of 2003. By reconstructing the limit order book, we can extra…

2010-03-12abs ↗pdf ↗

Optimistic method adapted for faster convex-concave min-max problems.

problem Solving convex-concave min-max optimization problems efficiently.
method Adaptive, line search-free second-order methods combining optimistic updates and second-order information.
result Achieves optimal convergence rate without line search or backtracking.

We examine the correlation of the limit price with the order book, when a limit order comes. We analyzed the Rebuild Order Book of Stock Exchange Electronic Trading Service, which is the centralized order book market of London Stock Exchange. As a result, the limit price is broadly distributed around the best price acc…

2007-02-04abs ↗pdf ↗

Most modern financial markets use a continuous double auction mechanism to store and match orders and facilitate trading. In this paper we develop a microscopic dynamical statistical model for the continuous double auction under the assumption of IID random order flow, and analyze it using simulation, dimensional analy…

2002-10-22abs ↗pdf ↗

We introduce a Markovian single point process model, with random intensity regulated through a buffer mechanism and a self-exciting effect controlling the arrival stream to the buffer. The model applies the principle of the Hawkes process in which point process jumps generate a shot-noise intensity field. Unlike the Ha…

2017-10-10abs ↗pdf ↗

Improved method finds second-order stationary points privately with better efficiency.

problem Finding second-order stationary points privately under differential privacy constraints.
method Adaptive batch sizes and binary tree mechanism.
result Improved bound for privately finding SOSP, matching state-of-the-art for FOSP.

This paper studies the Glosten Milgrom model whose risky asset value admits an arbitrary discrete distribution. Contrast to existing results on insider's models, the insider's optimal strategy in this model, if exists, is not of feedback type. Therefore a weak formulation of equilibrium is proposed. In this weak formul…

2013-10-18abs ↗pdf ↗

The study examines order flow in financial markets using fractional Lévy stable motion.

problem Challenges in selecting the best models for financial time series data.
method Investigates order disbalance time series from the perspective of fractional Lévy stable motion.
result Orders exhibit stable anti-correlation for 18 randomly selected stocks.

Muon optimizes training efficiency by improving data retention at large batch sizes.

problem Improving training efficiency and data retention at large batch sizes.
method Introducing Muon, a second-order optimizer, and combining it with muP for efficient hyperparameter transfer.
result Muon outperforms AdamW in retaining data efficiency at large batch sizes, enabling more economical training.

Large-scale distributed training of deep neural networks results in models with worse generalization performance as a result of the increase in the effective mini-batch size. Previous approaches attempt to address this problem by varying the learning rate and batch size over epochs and layers, or ad hoc modifications o…

2020-02-13abs ↗pdf ↗

We propose a method for detection and prediction of native and synthetic iceberg orders on Chicago Mercantile Exchange. Native (managed by the exchange) icebergs are detected using discrepancies between the resting volume of an order and the actual trade size as indicated by trade summary messages, as well as by tracki…

2019-09-20abs ↗pdf ↗

Enhances queue-reactive model for realistic limit order book simulation.

problem Realistic simulation of limit order books for market research and strategy development.
method Extends Queue-Reactive model with neural network for complex dependencies and varying market conditions.
result Captures key market properties like square-root law of market impact and order size patterns.

The second order method as Newton Step is a suitable technique in Online Learning to guarantee regret bound. The large data is a challenge in Newton method to store second order matrices as hessian. In this paper, we have proposed an modified online Newton step that store first and second order matrices of dimension m …

2019-04-11abs ↗pdf ↗

New method reduces ensemble size for linear bandits, achieving near optimal regret.

problem Achieving near optimal regret in linear bandits with limited ensemble size.
method Ensemble sampling with a size of order dlogTd \log T for a dd-dimensional stochastic linear bandit.
result Regret is at most (dlogT)5/2T(d \log T)^{5/2} \sqrt{T}, improving over linear scaling with TT.

A tick size is the smallest increment of a security price. It is clear that at the shortest time scale on which individual orders are placed the tick size has a major role which affects where limit orders can be placed, the bid-ask spread, etc. This is the realm of market microstructure and there is a vast literature o…

2010-09-13abs ↗pdf ↗

This paper investigates the scaling dependencies between measures of "activity" and of "size" for companies included in the FTSE 100. The "size" of companies is measured by the total market capitalization. The "activity" is measured with several quantities related to trades (transaction value per trade, transaction val…

2004-07-29abs ↗pdf ↗

We investigate the statistical properties of the EBS order book for the EUR/USD and USD/JPY currency pairs and the impact of a ten-fold tick size reduction on its dynamics. A large fraction of limit orders are still placed right at or halfway between the old allowed prices. This generates price barriers where the best …

2013-07-20abs ↗pdf ↗

A new method for faster optimization of noisy functions.

problem Optimizing noisy functions efficiently.
method A universal and adaptive second-order method for convex functions.
result Achieves O(σ/T)O(σ/ \sqrt{T}) convergence for stochastic oracles and O(1/T3)O( 1 / T^3) for deterministic oracles.

Recent empirical studies have demonstrated long-memory in the signs of orders to buy or sell in financial markets [2, 19]. We show how this can be caused by delays in market clearing. Under the common practice of order splitting, large orders are broken up into pieces and executed incrementally. If the size of such lar…

2004-12-27abs ↗pdf ↗

Study shows market quality improves with larger orders, not smaller tick sizes or higher trading frequencies.

problem Impact of order book tick sizes, metaorders, and trading frequencies on market quality.
method Multi-agent reinforcement learning model to simulate stock market dynamics.
result Market quality benefits from larger orders but not from smaller tick sizes or higher trading frequencies.

Mini-batch stochastic gradient descent (SGD) and variants thereof approximate the objective function's gradient with a small number of training examples, aka the batch size. Small batch sizes require little computation for each model update but can yield high-variance gradient estimates, which poses some challenges for…

2019-10-18abs ↗pdf ↗

Using the classification of transitive groups we classify indecomposable quandles of size <36. This classification is available in Rig, a GAP package for computations related to racks and quandles. As an application, the list of all indecomposable quandles of size <36 not of type D is computed.

2011-05-26abs ↗pdf ↗

It is known that the impact of transactions on stock price (market impact) is a concave function of the size of the order, but there exists little quantitative theory that suggests why this is so. I develop a quantitative theory for the market impact of hidden orders (orders that reflect the true intention of buying an…

2008-04-24abs ↗pdf ↗

Improved computational complexity in statistical models using second-order information.

problem Polynomial convergence of gradient descent in singular statistical models.
method Normalized Gradient Descent (NormGD) algorithm with second-order information.
result NormGD reaches final statistical radius in logarithmic iterations of nn.

New hypergraph neural network learns variable-sized hyperedges.

problem Learning representations for non-uniform hypergraphs with variable cardinalities.
method Developed a hypergraph neural network exploiting incidence structure.
result Significant improvement in accuracy on real-world hypergraph datasets.

Riemannian stochastic gradient descent converges faster with increasing batch size.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Theoretical analysis and numerical investigation of increasing batch size effects.
result Riemannian stochastic gradient descent converges faster with increasing batch size.