Causal adaptive intensity estimation for non-stationary point processes: a Kalman-kernel duality framework
Abstract
Estimating the instantaneous conditional intensity of a non-stationary point process from a single realization of discrete event timestamps is a fundamental problem in computational neuroscience, quantitative finance, and network monitoring. Traditional adaptive kernel methods achieve variable bandwidths through Abramson's square-root law, yet existing implementations require non-causal access to the complete event record and incur 𝒪(N2) or at best 𝒪(N log N) computational cost. Causal alternatives based on reciprocal inter-arrival times, meanwhile, suffer from systematic divergence under Poisson and bursty arrival dynamics due to Jensen's inequality. This paper addresses both limitations by establishing a formal duality between steady-state Kalman filtering and adaptive exponential kernel smoothing. An endogenous state-space observer is constructed in which Poisson counting statistics dictate the measurement noise (R ∝ λ) and geometric diffusion governs the process volatility (Q ∝ λ2). Under these physically motivated axioms, the algebraic Riccati equation autonomously yields an effective smoothing bandwidth scaling as τ∝ λ−1/2, giving a causal, recursive, 𝒪(1) per-step realization of square-root adaptive bandwidth scaling. A second-order constant-velocity extension produces a λ−1/4 scaling that reduces approximation bias, and a probabilistic dormant-state gating mechanism suppresses phantom intensity leakage during structural zeros. Synthetic benchmarks together with neural and financial data show that the observer adapts across orders of magnitude in intensity with an empirical per-step cost of approximately 30\,μs.
Related
- Functional limiting behaviour of non-stationary marked Hawkes processes under multi-scaling high-intensity regime
- Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning
- ShapleyOG: Fast Adaptive Shapley Value Estimation with Odd Gaussian Processes
- Adaptive Reliability-Aware Nonlinear State Estimation Framework for GNSS/INS Integrated Navigation with Bounded Position Correction
- A Novel Solving Method for Multi-Constrained Optimization of Ceramic Composite Armor with Failure Considerations Based on an Improved Response Surface Methodology–Adaptive Moment Estimation (RSM-Adam) Framework
BibTeX
@misc{qin2026causal,
title = {{Causal adaptive intensity estimation for non-stationary point processes: a Kalman-kernel duality framework}},
author = {Hanwu Qin and Dianhai Wang and Meng Zhang and Huangjun You and Zhengyi Cai},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.24018},
eprint = {2610.24018},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.24018},
}
RIS
TY - UNPB
TI - Causal adaptive intensity estimation for non-stationary point processes: a Kalman-kernel duality framework
AU - Hanwu Qin
AU - Dianhai Wang
AU - Meng Zhang
AU - Huangjun You
AU - Zhengyi Cai
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.24018
UR - https://arxiv.org/abs/2610.24018
AB - Estimating the instantaneous conditional intensity of a non-stationary point process from a single realization of discrete event timestamps is a fundamental problem in computational neuroscience, quantitative finance, and network monitoring. Traditional adaptive kernel methods achieve variable bandwidths through Abramson's square-root law, yet existing implementations require non-causal access to the complete event record and incur 𝒪(N^2) or at best 𝒪(N log N) computational cost. Causal alternatives based on reciprocal inter-arrival times, meanwhile, suffer from systematic divergence under Poisson and bursty arrival dynamics due to Jensen's inequality. This paper addresses both limitations by establishing a formal duality between steady-state Kalman filtering and adaptive exponential kernel smoothing. An endogenous state-space observer is constructed in which Poisson counting statistics dictate the measurement noise (R ∝ λ) and geometric diffusion governs the process volatility (Q ∝ λ^2). Under these physically motivated axioms, the algebraic Riccati equation autonomously yields an effective smoothing bandwidth scaling as τ∝ λ^−1/2, giving a causal, recursive, 𝒪(1) per-step realization of square-root adaptive bandwidth scaling. A second-order constant-velocity extension produces a λ^−1/4 scaling that reduces approximation bias, and a probabilistic dormant-state gating mechanism suppresses phantom intensity leakage during structural zeros. Synthetic benchmarks together with neural and financial data show that the observer adapts across orders of magnitude in intensity with an empirical per-step cost of approximately 30\,μs.
ER -