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

2735458181,090 · Jun 202019922001200920172026
48 results for arrival time functions

In this paper we study the distributional properties of a vector of lifetimes in which each lifetime is modeled as the first arrival time between an idiosyncratic shock and a common systemic shock. Despite unlike the classical multidimensional Marshall-Olkin model here only a unique common shock affecting all the lifet…

2017-04-07abs ↗pdf ↗

SMURF-THP improves Transformer Hawkes process models by providing uncertainty quantification.

problem Uncertainty quantification for Transformer Hawkes process predictions.
method Score matching for learning the score function of event arrival times.
result SMURF-THP outperforms likelihood-based methods in confidence calibration.

We present a simple connection between differential Harnack inequalities for hypersurface flows and natural concavity properties of their time-of-arrival functions. We prove these concavity properties directly for a large class of flows by applying a concavity maximum principle argument to the corresponding level set f…

2019-12-13abs ↗pdf ↗

We introduce a multivariate Hawkes process that accounts for the dynamics of market prices through the impact of market order arrivals at microstructural level. Our model is a point process mainly characterized by 4 kernels associated with respectively the trade arrival self-excitation, the price changes mean reversion…

2013-01-07abs ↗pdf ↗

Generalizes Fermat's principle for wave propagation in cone structures.

problem Wave propagation in complex media with discontinuities and anisotropy.
method Generalizes Fermat's principle to smooth interfaces separating two cone structures representing wave propagation in various media.
result Conditions for critical points of arrival time functional, generalizing Snell's law and reflection.

For a monotonically advancing front, the arrival time is the time when the front reaches a given point. We show that it is twice differentiable everywhere with uniformly bounded second derivative. It is smooth away from the critical points where the equation is degenerate. We also show that the critical set has finite …

2015-01-30abs ↗pdf ↗

In this paper, we introduce Ballooning Multi-Armed Bandits (BL-MAB), a novel extension of the classical stochastic MAB model. In the BL-MAB model, the set of available arms grows (or balloons) over time. In contrast to the classical MAB setting where the regret is computed with respect to the best arm overall, the regr…

2020-01-24abs ↗pdf ↗

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

Automatic Machine Learning (Auto-ML) systems tackle the problem of automating the design of prediction models or pipelines for data science. In this paper, we present Lifelong Bayesian Optimization (LBO), an online, multitask Bayesian optimization (BO) algorithm designed to solve the problem of model selection for data…

2019-05-29abs ↗pdf ↗

Study optimal periodic dividend strategies for risky businesses with transaction costs.

problem Optimal periodic dividend strategies for spectrally positive Lévy risk processes with fixed transaction costs.
method Investigates periodic (bu,bl)(b_u,b_l) strategies for a Poisson arrival process of decision times.
result A periodic (bu,bl)(b_u,b_l) strategy is optimal with lump sum dividends net of transaction costs.

This paper extends subordinated models to include stochastic time changes, improving financial modeling.

problem Improving financial models to better capture market features like jump clustering and volatility persistence.
method Subordinated processes with Levy and stochastic arrival mechanisms.
result Strong consistency and asymptotic normality results for VG and VGSA processes under various stochastic arrival models.

In this paper, we take a new approach for time of arrival geo-localization. We show that the main sources of error in metropolitan areas are due to environmental imperfections that bias our solutions, and that we can rely on a probabilistic model to learn and compensate for them. The resulting localization error is val…

2019-10-15abs ↗pdf ↗

A message passing algorithm is derived for recovering communities within a graph generated by a variation of the Barabási-Albert preferential attachment model. The estimator is assumed to know the arrival times, or order of attachment, of the vertices. The derivation of the algorithm is based on belief propagation unde…

2018-01-21abs ↗pdf ↗

Space debris warnings follow a predictable pattern, allowing timely satellite maneuvers.

problem Estimating when fresh information about space debris will arrive.
method Statistical learning model of the message arrival process, specifically a Bayesian Poisson process.
result The average prediction error for the next message arrival time is smaller than baseline predictions.

This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are characterized by the solution of a backward stochastic differential equation. The pa…

2018-03-01abs ↗pdf ↗

We studied non-dynamical stochastic resonance for the number of trades in the stock market. The trade arrival rate presents a deterministic pattern that can be modeled by a cosine function perturbed by noise. Due to the nonlinear relationship between the rate and the observed number of trades, the noise can either enha…

2008-07-06abs ↗pdf ↗

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 ↗

Modeling market dynamics with informed and uninformed traders and fads.

problem Optimizing market making in a market with fads, informed, and uninformed traders.
method Characterizing the optimal liquidity provision problem in a market with fads, informed, and uninformed traders, considering both complete and partial information.
result The price of liquidity is a function of the proportion of informed traders, and strategies ignoring fads underperform.

This paper tackles inventory control with general arrival dynamics and post-processing, improving profitability.

problem Inventory control with arbitrary arrival dynamics and post-processing constraints.
method Formulated as an exogenous decision process, incorporating deep generative models for arrivals, and applying supervised learning techniques.
result Improves profitability over production baselines and real-world A/B test data.

Survey of Fermat principle in general relativity and beyond.

problem Mathematical challenges in variational formulation of Fermat principle in Lorentzian geometry.
method Proof in smooth lightlike curves, analysis of null condition, alternative frameworks, multiplicity results.
result Space of lightlike curves does not admit a smooth manifold structure due to cone nature of null condition.

The paper optimizes portfolios in a market with hidden drift and random expert opinions.

problem Optimizing portfolios in a market with hidden Gaussian drift and random expert signals.
method Modeling the hidden drift using Kalman filters and solving the utility maximization problem with dynamic programming.
result Derivation of optimal portfolio weights and utility maximization under the given market conditions.

In order for an e-commerce platform to maximize its revenue, it must recommend customers items they are most likely to purchase. However, the company often has business constraints on these items, such as the number of each item in stock. In this work, our goal is to recommend items to users as they arrive on a webpage…

2019-11-18abs ↗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 ↗

The paper finds the shortest time to exploit arbitrage in multi-stock markets.

problem Finding the shortest time to exploit arbitrage in multi-stock markets.
method Characterizes the minimal time horizon for relative arbitrage in markets with 2 to 3 stocks and uses geometric flows for markets with 4 or more stocks.
result Explicit computation of minimal time horizon for 2 and 3 stocks markets, and characterization via geometric flows for markets with 4 or more stocks.

We investigate, focusing on the ruin probability, an adaptation of the Cramer-Lundberg model for the surplus process of an insurance company, in which, conditionally on their intensities, the two mixed Poisson processes governing the arrival times of the premiums and of the claims respectively, are independent. Such a …

2016-02-15abs ↗pdf ↗

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.