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

4080120160 · May 202619922001200920172026
48 results for discrete events

Proposes OC4Seq for detecting anomalies in discrete event sequences.

problem Challenges in detecting anomalies in discrete event sequences, including data imbalance, discrete events, and sequential nature.
method Integrates anomaly detection with recurrent neural networks (RNNs) to embed sequences into latent spaces and designs a multi-scale RNN framework to capture multi-scale sequential patterns.
result OC4Seq consistently outperforms various baselines on three benchmark datasets.

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.

New model for multivariate discrete event data with flexible interactions.

problem Modeling multivariate discrete event data with categorical interactions.
method Developed a new modeling approach with convex constraints, two estimation procedures (LS and ML).
result Proposed model can capture arbitrary shapes of historical event influence.

A new model predicts discrete events with flexible, nonparametric baseline and excitation.

problem Limited flexibility in discrete Hawkes models for event prediction.
method Gaussian Process Discrete Hawkes Process (GP-DHP) with collapsed latent representation.
result Improves predictive log-likelihood for diverse event patterns.

MOB-dS uses permutation to correct for dependency in discrete survival data.

problem Identifying subgroups in discrete event time data with potential spurious results.
method Model-based recursive partitioning (MOB) with modified data matrix and permutation test.
result MOB-dS controls type I error rate better than standard MOB for discrete survival data.

New STH distance finds patterns in event timeseries without resampling.

problem Lack of efficient analysis methods for event and state timeseries.
method Define STE-ts, propose STH, leveraging both time and state duration.
result Improved precision and computation time compared to resampled metrics.

Paper introduces a neural network-based non-stationary influence kernel for complex event data.

problem Modeling complex, non-stationary, and dependent discrete event data.
method Neural Spectral Marked Point Processes (NSMPP) with a versatile non-stationary influence kernel.
result NSMPP outperforms state-of-the-art models on synthetic and real data.

A simple guide to understanding hierarchical causality in complex systems.

problem Understanding hierarchical causality in complex systems.
method Formalizing hierarchical causality in terms of actors and agents, with three key structures.
result The system requires three additional structures: causation classes, aggregation operators, and discrete event-time maps.

SurvSurf predicts first hitting times for intermittent events without monotonic violations.

problem Predicting first hitting times for intermittent events with monotonicity guarantees.
method Partially monotonic neural network for sequential events, incorporating unobserved events.
result SurvSurf outperforms existing models in MSE and IBS metrics.

Efficiently models event-based data with general parametric kernels.

problem Inference for Hawkes processes with general parametric kernels requires large datasets.
method Developed a fast 2\ell_2 gradient-based solver using a discretized version of events.
result Improved estimation of pattern latency in brain signals.

This paper explores neural models to improve modeling of Hawkes process intensity functions.

problem Traditional Hawkes process intensity function's parametrized kernel function biases future event predictions.
method Uses neural models to model the kernel function of Hawkes process intensity function.
result Neural models can better capture future event characteristics using past events data.

New method for discrete-time survival analysis with competing risks.

problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.

We present the Infinite Latent Events Model, a nonparametric hierarchical Bayesian distribution over infinite dimensional Dynamic Bayesian Networks with binary state representations and noisy-OR-like transitions. The distribution can be used to learn structure in discrete timeseries data by simultaneously inferring a s…

2012-05-09abs ↗pdf ↗

A new method prices time-to-event cash flows using survival analysis.

problem Pricing insurance investment portfolios with time-to-event cash flows.
method Discrete-time survival analysis framework, hazard rate estimators, asymptotic multivariate normality.
result Pricing model yields estimates closer to actual cash flows than non-random models.

New framework models time-uncertain point processes for better event prediction.

problem Uncertainty in event times in point processes.
method Formulated and discretized continuous-time Hawkes processes with time grid, enabling optimization methods for inference.
result Parameter recovery with O(1/k)O(1/k) convergence rate using gradient descent and VI.

Many time series are effectively generated by a combination of deterministic continuous flows along with discrete jumps sparked by stochastic events. However, we usually do not have the equation of motion describing the flows, or how they are affected by jumps. To this end, we introduce Neural Jump Stochastic Different…

2019-05-24abs ↗pdf ↗

Research simulates Lloyd's of London's specialty insurance market dynamics.

problem Quantitative study of complex market phenomena in Lloyd's of London.
method Discrete Event Simulation (DES) framework for Lloyd's of London specialty insurance market.
result Model shows sophisticated exposure management reduces syndicate insolvency, and syndication enhances actuarial price accuracy.

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.

This chapter provides an accessible introduction for point processes, and especially Hawkes processes, for modeling discrete, inter-dependent events over continuous time. We start by reviewing the definitions and the key concepts in point processes. We then introduce the Hawkes process, its event intensity function, as…

2017-08-21abs ↗pdf ↗

This paper shows that one cannot learn the probability of rare events without imposing further structural assumptions. The event of interest is that of obtaining an outcome outside the coverage of an i.i.d. sample from a discrete distribution. The probability of this event is referred to as the "missing mass". The impo…

2015-03-12abs ↗pdf ↗

Continuous-time event sequences represent discrete events occurring in continuous time. Such sequences arise frequently in real-life. Usually we expect the sequences to follow some regular pattern over time. However, sometimes these patterns may be interrupted by unexpected absence or occurrences of events. Identificat…

2019-12-19abs ↗pdf ↗

The class of chain event graph models is a generalisation of the class of discrete Bayesian networks, retaining most of the structural advantages of the Bayesian network for model interrogation, propagation and learning, while more naturally encoding asymmetric state spaces and the order in which events happen. In this…

2009-04-06abs ↗pdf ↗

The Epps effect helps distinguish between continuous and discrete financial tick data.

problem Determining whether financial tick data represents continuous or discrete events.
method Deriving and correcting the Epps effect, proposing experiments to discriminate between models.
result Tick data is better represented as discrete events rather than continuous Brownian diffusions.

Neural surrogate predicts SPN rates from token trajectories.

problem Challenging parameter estimation in SPNs with covariates.
method 1D Convolutional Residual Network trained on Gillespie-simulated SPN realizations.
result Surrogate predicts rate-function coefficients with RMSE = 0.043.

In complex processes, various events can happen in different sequences. The prediction of the next event given an a-priori process state is of importance in such processes. Recent methods have proposed deep learning techniques such as recurrent neural networks, developed on raw event logs, to predict the next event fro…

2019-03-12abs ↗pdf ↗

This paper introduces the factorial marked temporal point process model and presents efficient learning methods. In conventional (multi-dimensional) marked temporal point process models, event is often encoded by a single discrete variable i.e. a marker. In this paper, we describe the factorial marked point processes w…

2018-01-21abs ↗pdf ↗

We present a novel Neural Embedding Spatio-Temporal (NEST) point process model for spatio-temporal discrete event data and develop an efficient imitation learning (a type of reinforcement learning) based approach for model fitting. Despite the rapid development of one-dimensional temporal point processes for discrete e…

2019-06-13abs ↗pdf ↗

The paper challenges the assumption of a unique global time in financial markets, highlighting market incompleteness.

problem The assumption of a unique global time in financial markets is challenged.
method The paper contrasts event-time, renewal, point-process, and order-flow descriptions of financial markets.
result Non-uniqueness of time leads to a more foundational form of market incompleteness.

Most real-world datasets, and particularly those collected from physical systems, are full of noise, packet loss, and other imperfections. However, most specification mining, anomaly detection and other such algorithms assume, or even require, perfect data quality to function properly. Such algorithms may work in lab c…

2019-04-10abs ↗pdf ↗

Unified framework detects changes in complex system models.

problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.

A deep neural network detects sleep events in polysomnograms with high accuracy.

problem Manual scoring of sleep events in clinical analysis is inconsistent and time-consuming.
method A single deep neural network architecture trained on 1653 recordings for joint detection of arousals, leg movements, and sleep disordered breathing.
result Joint detection of sleep events yields higher accuracy compared to separate models, and correlates well with manual annotations.

While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-d…

2019-05-24abs ↗pdf ↗

Event sequences can be modeled by temporal point processes (TPPs) to capture their asynchronous and probabilistic nature. We propose an intensity-free framework that directly models the point process distribution by utilizing normalizing flows. This approach is capable of capturing highly complex temporal distributions…

2019-10-18abs ↗pdf ↗

Large volume of networked streaming event data are becoming increasingly available in a wide variety of applications, such as social network analysis, Internet traffic monitoring and healthcare analytics. Streaming event data are discrete observation occurred in continuous time, and the precise time interval between tw…

2016-03-29abs ↗pdf ↗

Study shows pre-event L2 liquidity state predicts crypto futures liquidity better than event labels.

problem Understanding how crypto futures liquidity changes over time.
method Combining L2 order book data, trade-flow records, and macro-event windows to define discrete liquidity-state transitions and evaluate models.
result Pre-event L2 liquidity state predicts post-event liquidity regimes better than event labels, and order flow adds value only when layered on top of the state model.

New model captures time and mark inter-dependence in TPPs.

problem Limited predictive performance of conditionally independent TPP models on entangled time and mark interactions.
method Developed a multivariate TPP that models conditional inter-dependence of time and mark, using both intensity-based and intensity-free models.
result Proposed TPP models outperform conditionally independent and dependent models in standard prediction tasks.