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.

169,051 papers · 148 categories

Trend · papers per month

2468 · Oct 202519922001200920182026
48 results for queue reactive

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.

Unified model for market dynamics, linking price and order flow.

problem Modeling market dynamics and order flow in a unified framework.
method Markovian market model driven by a hidden Brownian efficient price, signal-driven and queue-reactive models.
result Stability of mid-price around efficient price at macroscopic scale, behavior as diffusion.

Paper improves volatility estimation using a Queue-Reactive model.

problem Volatility estimation from high-frequency data is biased by microstructure noise.
method Uses Queue-Reactive model of limit order book to improve volatility estimation.
result Unified and alternation estimators lead to optimal mean squared error for integrated volatility.

We model the behavior of three agent classes acting dynamically in a limit order book of a financial asset. Namely, we consider market makers (MM), high-frequency trading (HFT) firms, and institutional brokers (IB). Given a prior dynamic of the order book, similar to the one considered in the Queue-Reactive models [14,…

2018-02-16abs ↗pdf ↗

The paper develops algorithms to minimize queue length regret in a communication system.

problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal O(1)O(1) queue length regret can be achieved with queue-length based policies.

Study on queues with Hawkes arrivals, proving steady-state behavior and developing an efficient algorithm.

problem Analyzing the steady-state behavior of queues with Hawkes arrivals.
method Novel coupling techniques and exponential convergence results for workload and busy period processes.
result Exponential convergence of queueing processes to their stationary distribution.

Algorithm stabilizes queues in asymmetric systems with unknown service rates.

problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).

The paper analyzes transaction fees on blockchains using a priority queue model.

problem Understanding and optimizing transaction fees on blockchain networks.
method An M/G^K/1 priority queue model is used to analyze transaction fees and user behavior.
result New insights into the dynamics of transaction fees and their impact on user behavior are provided.

Designs for allocating resources to prioritize needy applicants while estimating treatment effects.

problem Resource allocation under uncertainty with prioritized queues.
method Priority-queue randomization for treatment assignment and estimation of treatment effects.
result Identification of causal effects under different arrival and treatment assignment scenarios.

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

Through the analysis of a dataset of ultra high frequency order book updates, we introduce a model which accommodates the empirical properties of the full order book together with the stylized facts of lower frequency financial data. To do so, we split the time interval of interest into periods in which a well chosen r…

2013-12-02abs ↗pdf ↗

MPC outperforms reactive budgeting in non-stationary return environments.

problem Optimizing budget allocation under non-stationary returns.
method Receding-horizon Model Predictive Control (MPC) compared to reactive policies.
result MPC consistently outperforms reactive budgeting when return dynamics are predictable.

MERLIN tackles multi-objective task scheduling with hierarchical DRL, outperforming existing methods.

problem Optimizing multiple conflicting constraints in multi-objective task scheduling with varying queue sizes.
method Hierarchical deep reinforcement learning approach to manage large queues efficiently.
result MERLIN outperforms existing methods by a large margin (>22%) on multiple queue sizes.

The paper models blockchain queues and trading dynamics, finding conditions for transaction priority and price impact.

problem Understanding and predicting price impacts in blockchain trading environments.
method Developed a probabilistic model for blockchain queues with adversarial scheduling, derived expressions for transaction priority and price impact.
result Conditions for transaction priority and statistical models for price impact in blockchain trading environments.

Statistical learning improves reactive power control in distribution systems.

problem Challenges in reactive power control due to renewable energy sources and flexible loads.
method A deep neural network parameterizes the input-output relationship between grid states and optimal reactive power control. Unknown weights are learned offline to minimize power loss, and inference is fast with matrix-vector multiplications.
result Computational efficiency and robustness to random input perturbations demonstrated in a 47-bus distribution network.

Queue-based resampling tackles online class imbalance learning with selective resampling of past examples.

problem Online class imbalance learning under class imbalance and concept drift.
method Queue-based resampling algorithm that selectively includes past examples in the training set.
result Queue-based resampling outperforms state-of-the-art methods in terms of learning speed and quality.

Order positions are key variables in algorithmic trading. This paper studies the limiting behavior of order positions and related queues in a limit order book. In addition to the fluid and diffusion limits for the processes, fluctuations of order positions and related queues around their fluid limits are analyzed. As a…

2015-05-18abs ↗pdf ↗

Study improves queue length estimation from connected vehicles by filtering parameters.

problem Large errors in estimated queue lengths at low market penetration rates.
method Used Kalman and Particle filters as multilevel real-time estimators.
result Filters reduce estimation errors and improve accuracy within 15 minutes.

A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.

problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.

The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.

problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.

In this paper, a novel joint transmit power and resource allocation approach for enabling ultra-reliable low-latency communication (URLLC) in vehicular networks is proposed. The objective is to minimize the network-wide power consumption of vehicular users (VUEs) while ensuring high reliability in terms of probabilisti…

2018-05-11abs ↗pdf ↗

Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation, that explicitly includes state dependence, i.e. the fact that the drift and diffusion depends on the volume present on both sides of the spread. "J…

2013-04-25abs ↗pdf ↗

We present a new volatility model, simple to implement, that includes a leverage effect whose return-volatility correlation function fits to empirical observations. This model is able to capture both the "retarded effect" induced by the specific risk, and the "panic effect", which occurs whenever systematic risk become…

2012-09-24abs ↗pdf ↗

The paper optimizes LLM inference systems through queueing theory.

problem Efficient LLM inference for AI agents under various routing topologies.
method Developed a fluid-limit framework for multi-class batched processing networks under K-FCFS scheduling.
result Proved that work-conserving scheduling algorithms maximize throughput for LLM inference.

Machine learning models accurately predict the state and dynamics of reactive mixing.

problem Accurate prediction of reactive mixing for Earth and environmental science applications.
method Built a high-fidelity numerical model to simulate reactive mixing scenarios. Used 20 different machine learning emulators to classify mixing state and predict three QoIs.
result Ensemble methods and MLP models accurately predict the state of reactive mixing and QoIs, significantly faster than high-fidelity simulations.

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

This paper attempts to find out numerically the distribution of the queue-length ratio in the context of a model of preferential attachment. Here we consider two restaurants only and a large number of customers (agents) who come to these restaurants. Each day the same number of agents sequentially arrives and decides w…

2008-08-23abs ↗pdf ↗

The paper improves regret bounds for admission control in queueing systems.

problem Improving regret bounds for admission control in queueing systems.
method Proposes an algorithm inspired by UCRL2 and uses problem structure to bound regret.
result Proves an upper bound on the expected total regret of O(SlogT+mTlogT)O(S\log T + \sqrt{mT \log T}).

Generative adversarial networks improve subgrid modeling in turbulent reactive flows.

problem Accurately predicting turbulent reactive flows in combustion problems.
method Physics-informed super-resolution GANs trained with unsupervised deep learning.
result Good results in a priori and a posteriori tests with decaying turbulence.

Algorithm improves reinforcement learning policies using offline data.

problem Improving reinforcement learning policies with limited online data.
method Designs a single non-reactive policy using offline data with provable guarantees.
result Algorithm achieves better policy quality with less online data.

The paper proposes a data-driven method for optimal power flow and voltage regulation in distribution grids.

problem Optimal power flow and voltage regulation in decentralized power grids.
method The approach uses a network model, historic data, and regression to find functions approximating optimal reactive power injections for inverters.
result The method achieves near-optimal results in voltage- and capacity-constrained loss minimization and voltage flattening.

AIF improves physical AI agents' performance in dynamic environments.

problem Physical AI agents are less capable than biological agents in open-ended real-world environments.
method Developed from probability theory, Bayesian machine learning, variational inference, and Active Inference (AIF), grounded in the Free Energy Principle.
result AIF minimizes variational free energy and is well-suited to physical constraints.

We examine the dynamics of the bid and ask queues of a limit order book and their relationship with the intensity of trade arrivals. In particular, we study the probability of price movements and trade arrivals as a function of the quote imbalance at the top of the limit order book. We propose a stochastic model in an …

2013-12-02abs ↗pdf ↗

The study examines how backrun auctions can protect traders from price manipulation.

problem Price manipulation by arbitrageurs in batched trading venues.
method Developed a laminated queueing model to study price manipulation and introduced a price manipulation coefficient.
result Bound the price manipulation coefficient and found it approximated by a 'zeta value' with measurable parameters.