New CUSUM method detects changes in Hawkes networks efficiently.
problem Detecting abrupt changes in Hawkes networks.
method Efficient online recursive implementation of CUSUM statistic.
result Proposed CUSUM method outperforms existing methods.
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,742 papers · 148 categories
Trend · papers per month
48 results for “CUSUM process”
NN-CUSUM detects changes in high-dimensional data using neural networks.
problem Detecting abrupt changes in high-dimensional data.
method Neural network-based CUSUM for online change-point detection.
result NN-CUSUM performs well in detecting changes in high-dimensional data.
FOCuS detects changes in mean from high-frequency data efficiently.
problem Detecting changes in high-frequency data with limited resources.
method FOCuS algorithm that runs multiple window sizes and change sizes simultaneously.
result FOCuS achieves state-of-the-art performance in detecting anomalies.
Paper optimizes change detection in unnormalized distributions.
problem Detecting changes in unnormalized pre- and post-change distributions.
method Log-Partition Approximation Cumulative Sum (LPA-CUSUM) algorithm based on thermodynamic integration.
result Asymptotically optimal performance achieved through unbiased estimation of CUSUM statistics.
New method detects changes in high-dimensional Markov processes without explicit likelihood evaluation.
problem Quickest change detection in Markov processes with unknown transition kernels.
method Learn conditional score from sample pairs, develop score-based CUSUM procedure.
result Exponential lower bounds on mean time to false alarm and asymptotic upper bounds on detection delay.
New CUSUM algorithm detects changes in unnormalized models.
problem Change detection in models with unknown normalization constants.
method Score-based CUSUM (SCUSUM) algorithm based on Fisher divergence and Hyvärinen score.
result Asymptotic optimality of the SCUSUM algorithm demonstrated.
Efficient online kernel CUSUM detects changes quickly and accurately.
problem Detecting changes in online data streams efficiently.
method Online kernel CUSUM using maximum kernel statistics.
result Increased sensitivity to small changes compared to existing methods.
Fast detection of changepoints in linear regression models.
problem Early detection of changes in linear regression models.
method Heavy-weighted CUSUM statistics and composite statistics.
result Effective detection of changepoints regardless of their location.
Score-Based Change-Point Detection and Region Localization for Spatio-Temporal Point Processesstat.ME
New method detects and locates changes in spatio-temporal point processes.
problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.
The multi-armed bandit problem has been extensively studied under the stationary assumption. However in reality, this assumption often does not hold because the distributions of rewards themselves may change over time. In this paper, we propose a change-detection (CD) based framework for multi-armed bandit problems und…
Detecting weak clustered signal in spatial data is important but challenging in applications such as medical image and epidemiology. A more efficient detection algorithm can provide more precise early warning, and effectively reduce the decision risk and cost. To date, many methods have been developed to detect signals…
Paper detects and estimates breaks in high-dimensional functional time series.
problem Detecting and estimating structural breaks in heterogeneous mean functions of high-dimensional functional time series.
method Proposes a new test statistic combining functional CUSUM and power enhancement components, with a clustering algorithm for group structure estimation.
result The proposed techniques have satisfactory performance in finite samples, detecting and estimating breaks effectively.
Develops a nonparametric framework for detecting changes in sequential data.
problem Detecting changes in nonparametrically specified distributions.
method Introduces e-detectors based on e-processes for nonnegative supermartingales.
result Provides bounds on average run length and detection delay.
Detects graph topology changes from noisy signals using prior spectral information.
problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.
New algorithms detect and react to multiple change points in online learning.
problem Learning under multiple change points in environments with unknown and frequent shifts.
method Proposed Anytime Tracking CUSUM (ATC) algorithms that balance detection of significant shifts.
result Properly tuned ATC algorithms achieve nearly minimax-optimal performance.
We study the problem of detecting a change in the mean of one-dimensional Gaussian process data. This problem is investigated in the setting of increasing domain (customarily employed in time series analysis) and in the setting of fixed domain (typically arising in spatial data analysis). We propose a detection method …
Deep learning generates efficient change-point detection methods.
problem Detecting change-points in data with various types of change and data behavior.
method Train a neural network to automatically generate detection methods.
result Neural network-based methods are competitive and outperform standard methods in various noise conditions.
New exact tests detect changepoints in binary and count data, especially when normal approximations fail.
problem Detecting changepoints in multichannel binary and count data.
method Exact tests combining two-sample conditional tests with multiplicity correction.
result Exact tests are much more powerful than asymptotic tests in various settings.
Boosts change-point detection power with optimal sub-sampling.
problem Power loss in sequential change-point detection from large history data.
method Optimal sub-sampling of history data before kernel-based detection procedures.
result Improved detection performance in extensive experiments.
We propose a method that performs anomaly detection and localisation within heterogeneous data using a pairwise undirected mixed graphical model. The data are a mixture of categorical and quantitative variables, and the model is learned over a dataset that is supposed not to contain any anomaly. We then use the model o…
New algorithm catches moving subspaces in bandit problems.
problem Adapt to changing low-dimensional latent subspaces in bandit settings.
method Piecewise-stationary low-rank linear contextual bandits with CUSUM-style boundary detection.
result Achieves intrinsic rank dynamic regret rate of .
New method detects strong calibration in ML models, even for small poorly calibrated subgroups.
problem Auditing machine learning models for strong calibration is difficult, especially for small poorly calibrated subgroups.
method Reorder observations by expected residuals and use changepoint detection for score-based cumulative sum (CUSUM) test.
result The proposed adaptive CUSUM test consistently achieved higher power and more than doubled power in auditing mortality risk prediction models.
We consider the problem of quickest change-point detection in data streams. Classical change-point detection procedures, such as CUSUM, Shiryaev-Roberts and Posterior Probability statistics, are optimal only if the change-point model is known, which is an unrealistic assumption in typical applied problems. Instead we p…
Testing randomnessmath.PR
The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability distribution. This hypothesis is close, in certain respects, to the hypothesis of exchangeab…
This paper improves change-point detection for complex data streams using denoising score matching.
problem Timely identification of distributional shifts in high-dimensional, complex data streams.
method Score-based CUSUM change-point detection with denoising score matching.
result Denoising score matching enhances detection power by effectively controlling noise scale.
Develops methods to test nonstationarity and detect change points in RL.
problem Nonstationary environments in reinforcement learning.
method Consistent testing procedure and change point detection method.
result Validates the effectiveness of the proposed methods in real data.
Optimizes quickest change detection with bounded means under ARL constraint.
problem Quickest detection of changepoints with bounded means under ARL constraint.
method Derives universal lower and upper bounds for detection delay.
result Achieves universal lower bound in the bounded mean detection setting.
The goal of Ordinal Regression is to find a rule that ranks items from a given set. Several learning algorithms to solve this prediction problem build an ensemble of binary classifiers. Ranking by Projecting uses interdependent binary perceptrons. These perceptrons share the same direction vector, but use different bia…
The Lucas critique has exposed the problem of the trade-off between changes in monetary policy and structural breaks in economic time series. The search for and characterisation of such breaks has been a major econometric task ever since. We have developed an integral technique similar to CUSUM using an empirical model…
New monitoring method detects ML risk models' performance changes in medical interventions.
problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.
KCUSUM detects abrupt changes in real-time data streams efficiently.
problem Detecting abrupt changes in high-volume scientific data streams.
method Kernel-based Cumulative Sum (KCUSUM) algorithm using Maximum Mean Discrepancy (MMD).
result KCUSUM outperforms traditional CUSUM in online change point detection.
This chapter is an attempt to present a mathematical theory of compound fractional Poisson processes. The chapter begins with the characterization of a well-known Lévy process: The compound Poisson process. The semi-Markov extension of the compound Poisson process naturally leads to the compound fractional Poisson proc…
We introduce a class of hybrid marked point processes, which encompasses and extends continuous-time Markov chains and Hawkes processes. While this flexible class amalgamates such existing processes, it also contains novel processes with complex dynamics. These processes are defined implicitly via their intensity and a…
Deep Neyman-Scott Processesstat.ML
A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.
problem Efficient inference in complex hierarchical point processes.
method Developed an efficient posterior sampling via Markov chain Monte Carlo for likelihood-based inference.
result More hidden Poisson processes improve likelihood fitting and event prediction.
The study examines Hawkes processes and their long-term behavior.
problem Understanding the long-term behavior of Hawkes processes.
method Proving functional limit theorems under various conditions on the dispersion of child events.
result Functional limit theorems hold for Hawkes processes with different levels of child event dispersion.
Elliptical processes generalize Gaussian and Student-t models with fat tails and computational efficiency.
problem Need for models with fat tails and computational tractability.
method Represent elliptical distributions as continuous mixtures of Gaussian distributions, derive closed-form expressions for marginal and conditional distributions.
result Elliptical processes offer advantages in robust regression compared to Gaussian processes.
We show that the stick-breaking construction of the beta process due to Paisley, et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. Specifically, we show that the mean measure of the underlying Poisson process is equal to that of the beta process. We use this underlying re…
We investigate the Student-t process as an alternative to the Gaussian process as a nonparametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the covariance kernel of a G…
Efficient methods for Lévy models using SINH-regular processes.
problem Efficient numerical methods for evaluating Lévy models.
method Defining SL-processes and sSL-processes, deriving properties of characteristic exponent, and showing all popular Lévy processes can be subordinated to Brownian motion.
result All crucial properties of characteristic exponent are consequences of a specific representation, and all popular Lévy processes are SL- or sSL-subordinated Brownian motion.
The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…
A Technique for Determining Relevance Scores of Process Activities using Graph-based Neural Networkscs.LG
GRM uses graph neural networks to score process activity relevance.
problem Improving business processes with performance measures.
method Graph Relevance Miner (GRM) based on graph neural networks.
result Quantitatively evaluated relevance scores with four datasets.
Researchers study the geometric properties of a specific type of stable processes.
problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.
This study bridges discrete and continuous state spaces using the Ehrenfest process and diffusion models.
problem Understanding the relationship between discrete and continuous state spaces in stochastic processes.
method Investigates time-continuous Markov jump processes on discrete state spaces and their correspondence to state-continuous diffusion processes.
result The time-reversal of the Ehrenfest process converges to the time-reversed Ornstein-Uhlenbeck process, bridging discrete and continuous state spaces.
The fractional Poisson process (FPP) is a counting process with independent and identically distributed inter-event times following the Mittag-Leffler distribution. This process is very useful in several fields of applied and theoretical physics including models for anomalous diffusion. Contrary to the well-known Poiss…
Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…
Elliptical processes extend Gaussian models with heavier tails.
problem Regression and classification with non-Gaussian likelihoods or heavy tails.
method Spline normalizing flow for variational inference of elliptical distributions.
result Elliptical processes outperform Gaussian processes in non-Gaussian settings.
Ruin Probabilities for Risk Processes with Non-Stationary Arrivals and Subexponential Claimsq-fin.RM
In this paper, we obtain the finite-horizon and infinite-horizon ruin probability asymptotics for risk processes with claims of subexponential tails for non-stationary arrival processes that satisfy a large deviation principle. As a result, the arrival process can be dependent, non-stationary and non-renewal. We give t…
We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…