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

Trend · papers per month

69138207276 · Jun 202019922001200920172026
48 results for queuing dynamics

We present a queuing model of parking dynamics and a model-based prediction method to provide real-time probabilistic forecasts of future parking occupancy. The queuing model has a non-homogeneous arrival rate and time-varying service time distribution. All statistical assumptions of the model are verified using data f…

2019-08-29abs ↗pdf ↗

Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by point process models. However, these approaches are limited by parametric assump…

2019-06-24abs ↗pdf ↗

Decentralized learning ensures stability in online queuing systems with packet rates above 1.

problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.

A learning-based algorithm optimizes admission control in a queuing system.

problem Optimizing admission decisions in a queuing system with unknown parameters.
method Proposes a learning-based dispatching algorithm to minimize regret compared to optimal policies.
result Achieves optimal regret bounds for different scenarios of unknown parameters.

The paper analyzes fill probabilities in limit order books with varying price levels.

problem Determining the likelihood of limit orders being executed in a limit order book.
method Developed a state-dependent stochastic framework to model limit order book dynamics.
result Derived semi-analytical expressions for fill probabilities and mid-price changes.

Study uses data to analyze COPD patients' impact on hospital systems.

problem Understanding and quantifying resource requirements for COPD patients.
method Combines segmentation, queuing theory, and data recovery techniques.
result Finding useful operational results from incomplete administrative data.

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

A hybrid model combines BPH and HE distributions for better heavy-tailed distribution approximation.

problem Accurate modeling of heavy-tailed distributions in various applications.
method A hybrid model of Bernstein phase-type and hyperexponential distributions with optimized parameters.
result Significant improvement in capturing both body and tail of heavy-tailed distributions.

Algorithm improves reinforcement learning in MDPs with partial order policies.

problem Improving reinforcement learning in MDPs with partial order policies.
method Epoch-based reinforcement learning algorithm leveraging a partial order over policy class.
result Achieves an O(wlog(Θ)T)O(\sqrt{w \log(|Θ|) T}) regret bound, independent of state and action space sizes.

New RL method improves on standard discounted RL for operations research.

problem Applying RL to operations research problems, especially with non-zero rewards.
method Near-Blackwell-optimal RL algorithm that assesses average reward per step.
result Proves viability on challenging queuing system problems.

We study the dynamics of the limit order book of liquid stocks after experiencing large intra-day price changes. In the data we find large variations in several microscopical measures, e.g., the volatility the bid-ask spread, the bid-ask imbalance, the number of queuing limit orders, the activity (number and volume) of…

2009-01-05abs ↗pdf ↗

Asynchronous methods are widely used in deep learning, but have limited theoretical justification when applied to non-convex problems. We show that running stochastic gradient descent (SGD) in an asynchronous manner can be viewed as adding a momentum-like term to the SGD iteration. Our result does not assume convexity …

2016-05-31abs ↗pdf ↗

We analyze a method to produce pairs of non independent Poisson processes M(t),N(t)M(t),N(t) from positively correlated, self-decomposable, exponential renewals. In particular the present paper provides the family of copulas pairing the renewals, along with the closed form for the joint distribution pm,n(s,t)p_{m,n}(s,t) of the pair…

2015-09-02abs ↗pdf ↗

Strong stability of ergodic iterations proven without ergodic driving sequence.

problem Ensuring strong stability of ergodic iterations under non-ergodic driving sequences.
method Revisiting processes driven by stationary ergodic sequences, proving strong stability under mild conditions on recursive maps.
result Strong stability of iterations proven without ergodic driving sequence.

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 ↗

Likelihood-free inference involves inferring parameter values given observed data and a simulator model. The simulator is computer code which takes parameters, performs stochastic calculations, and outputs simulated data. In this work, we view the simulator as a function whose inputs are (1) the parameters and (2) a ve…

2019-10-08abs ↗pdf ↗

Research optimizes C++ patterns for HFT, reducing latency and improving profitability.

problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.

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}).

New method simulates sticky boundaries in multidimensional diffusions.

problem Simulating sticky boundaries in multidimensional diffusions.
method Approximate sticky diffusion by a Markov chain, using either finite difference or matching local moments.
result Validates both construction methods for first-order simulation schemes.

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.

Study on Bitcoin transaction flows and holding times, revealing multifractal and power-law distributions.

problem Characterizing the temporal behavior and variability of Bitcoin transactions and holding times.
method Analysis of Bitcoin transaction data, including holding-time distributions, multiscaling, and multifractality.
result Found multifractal and power-law distributions in Bitcoin transaction flows and holding times, with significant variations in holding times.

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 ↗

Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.

problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

DOODL learns shared spectral dynamics across related dynamical systems.

problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…

2013-12-04abs ↗pdf ↗

Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.

problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.

dLDS models neural dynamics as sparse combinations of simpler components.

problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…

2015-03-23abs ↗pdf ↗