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

2579 · May 202619922001200920172026
48 results for WAIT e-processes

This paper shows how to combine optimal tests into log-optimal processes.

problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.

In sequential anytime-valid inference, any admissible procedure must be based on e-processes: generalizations of test martingales that quantify the accumulated evidence against a composite null hypothesis at any stopping time. This paper proposes a method for combining e-processes constructed in different filtrations b…

2024-02-15abs ↗pdf ↗

A new method for backtesting ES forecasts in banking.

problem Designing a model-free backtesting procedure for Expected Shortfall forecasts.
method Use e-values and e-processes to introduce backtest e-statistics for VaR and ES.
result The proposed method can be applied to various risk measures and statistical quantities.

CSA fills a gap in RLVR-trained LLM deployment by providing anytime-valid selective risk control.

problem Deployment of RLVR-trained LLMs in regulated organizations requires a safety certificate for every round without waiting for long-run averages.
method CSA uses a (test statistic, validity guarantee, deployment rule) framework to fill the gap, maintaining a Ville-type e-process per threshold on a Bonferroni grid.
result CSA provides the first anytime-valid selective risk control for RLVR-trained LLMs, matching the long-run average certification rate and satisfying pathwise validity and non-refusing deployment on every cell.

Develops new e-processes and confidence sequences for Gaussian means with unknown variance.

problem Constructing valid t-tests and confidence sequences for Gaussian means with unknown variance.
method Explores generalized nonintegrable martingales and extended Ville's inequality, developing two new e-processes and confidence sequences.
result Analyzes the width of resulting confidence sequences with a polynomial dependence on error probability, proving it to be unavoidable and even better than classical fixed-sample t-tests.

We investigate the waiting-time distribution of the absolute return in the Korean stock-market index KOSPI. We define the waiting time as a time interval during which the normalized absolute return remains continuously below a threshold rcr_c. Through an exponential bin plot, we observe that the waiting-time distributi…

2005-08-30abs ↗pdf ↗

A new method for releasing AI workflows to avoid premature incorrect results.

problem Statistical challenges in releasing AI workflows with adaptive scoring.
method Wrapper that calibrates and accumulates evidence from high-scoring failures.
result Reduces premature incorrect release while still releasing on moderate evidence.

In high frequency financial data not only returns but also waiting times between trades are random variables. In this work, we analyze the spectra of the waiting-time processes for tick-by-tick trades. The numerical problem, strictly related with the real inversion of Laplace transforms, is analyzed by using Tikhonov's…

2008-01-19abs ↗pdf ↗

We investigate intra-day foreign exchange (FX) time series using the inverse statistic analysis developed in [1,2]. Specifically, we study the time-averaged distributions of waiting times needed to obtain a certain increase (decrease) ρρ in the price of an investment. The analysis is performed for the Deutsch mark (DM…

2004-02-24abs ↗pdf ↗

In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …

2005-05-31abs ↗pdf ↗

In high-frequency financial data not only returns, but also waiting times between consecutive trades are random variables. Therefore, it is possible to apply continuous-time random walks (CTRWs) as phenomenological models of the high-frequency price dynamics. An empirical analysis performed on the 30 DJIA stocks shows …

2003-10-14abs ↗pdf ↗

Continuous time random walks (CTRWs) are used in physics to model anomalous diffusion, by incorporating a random waiting time between particle jumps. In finance, the particle jumps are log-returns and the waiting times measure delay between transactions. These two random variables (log-return and waiting time) are typi…

2006-08-29abs ↗pdf ↗

Extends FC-RAG to anytime-valid sequential coverage for language model swarms.

problem Maintain distribution-free coverage for a swarm of weak language models over time.
method Introduces Anytime-FC-RAG, a sequential extension with a summable calibration-deviation budget.
result Achieves time-uniform alarm validity and safety under predictable adaptive control.

Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy tailed jumps, and the time-fractional version codes heavy tailed waiting times. Thi…

2008-09-09abs ↗pdf ↗

A theory which describes the share price evolution at financial markets as a continuous-time random walk has been generalized in order to take into account the dependence of waiting times t on price returns x. A joint probability density function (pdf) which uses the concept of a Lévy stable distribution is worked out.…

2003-10-15abs ↗pdf ↗

Modeling business expansion as a stochastic control problem, the study finds that firms are incentivized to expand but may wait.

problem Optimizing business expansion under exposure constraints and opportunity costs.
method Formulated as a novel stochastic control problem combined with optimal stopping time, derived an explicit solution for exponential utility.
result Firms are incentivized to expand but may wait due to opportunity costs and other factors.

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

In this paper, the survival function of waiting times between orders and the corresponding trades in a double-auction market is studied both by means of experiments and of empirical data. It turns out that, already at the level of order durations, the survival function cannot be represented by a single exponential, thu…

2006-08-28abs ↗pdf ↗

This paper shows how to construct sequential tests with power one against weakly compact sets in Polish spaces.

problem Testing composite null hypotheses involving weakly compact sets in Polish spaces.
method Develops sequential tests for i.i.d. laws in Polish spaces, providing a sufficient condition for power one.
result Power-one sequential tests exist for weakly compact sets against their complements in i.i.d. laws in Polish spaces.

We propose a useful approach for investigating the statistical properties of foreign currency exchange rates. Our approach is based on queueing theory, particularly, the so-called renewal-reward theorem. For the first passage processes of the Sony Bank US dollar/Japanese yen (USD/JPY) exchange rate, we evaluate the ave…

2006-06-05abs ↗pdf ↗

Unified framework controls false discovery rate in bandit multiple testing.

problem Designing adaptive algorithms to identify true discoveries in multiple hypothesis testing.
method Unified modular framework using e-processes for FDR control in arbitrary settings.
result Unified framework ensures FDR control for dependent and simultaneous arm queries.

Inverse statistics in economics is considered. We argue that the natural candidate for such statistics is the investment horizons distribution. This distribution of waiting times needed to achieve a predefined level of return is obtained from (often detrended) historic asset prices. Such a distribution typically goes t…

2002-11-02abs ↗pdf ↗

A new algorithm reduces training time for distributed machine learning by dynamically assigning backup workers.

problem Time-consuming synchronization phase due to slow workers (stragglers).
method Dynamic allocation of backup workers to minimize waiting time.
result Achieves linear speedup in convergence performance with more workers.

New approach uses deep reinforcement learning for vehicle dispatching, reducing waiting times.

problem Dynamic vehicle dispatching problem in various contexts.
method Event-based semi-Markov decision process with deep q-learning.
result Deep reinforcement learning policies outperform heuristic methods in New York City data.

Algorithm maximizes rewards with a budget and giving up option.

problem Sequential decision-making with stochastic rewards and resource consumption.
method Upper Confidence Bound (UCB) algorithm for maximizing cumulative reward.
result Logarithmic regret bound with improved dependence on problem parameters.

The inverse statistics is the distribution of waiting times needed to achieve a predefined level of return obtained from (detrended) historic asset prices \cite{optihori,gainloss}. Such a distribution typically goes through a maximum at a time coined the {\em optimal investment horizon}, τρτ^*_ρ, which defines the most…

2006-01-02abs ↗pdf ↗

The level crossing and inverse statistics analysis of DAX and oil price time series are given. We determine the average frequency of positive-slope crossings, να+ν_α^+, where Tα=1/να+T_α =1/ν_α^+ is the average waiting time for observing the level αα again. We estimate the probability P(K,α)P(K, α), which provides us the probab…

2010-01-25abs ↗pdf ↗

Exploiting a precise reproduction of a stock exchange, the robustness of the Continuous Double Auction (CDA) mechanism, evaluated by means of the waiting time distributions, has been proved versus 36 different set ups made by varying both the operators' behaviour and the market micro structure. The obtained results dem…

2008-02-22abs ↗pdf ↗