math.STNov 2, 2026

Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning

Authors: Atsutomo Yara, Yoshikazu Terada

Organizations: Graduate School of Engineering Science, the University of Osaka · RIKEN Center for Advanced Intelligence Project (AIP)

Abstract

We consider nonparametric maximum likelihood estimation of the intensity function of a Poisson process, allowing the intensity to depend on observed covariates. Such models describe how event rates vary with external conditions, including conditions under which the intensity becomes arbitrarily small or vanishes. However, risk analysis based on the Kullback-Leibler (KL) divergence typically requires the true intensity to be bounded away from zero, a restrictive assumption in applications. We develop a unified approach that avoids this assumption and derive an oracle inequality for the covariate-averaged Hellinger distance between the true intensity and the nonparametric maximum likelihood estimator (NPMLE). As an application of the oracle inequality, we establish convergence rates for NPMLEs based on deep neural networks (DNNs). Our results show that, as in nonparametric regression, the ability of DNNs to capture underlying structure leads to improved convergence rates. Specifically, DNN-based NPMLEs mitigate the curse of dimensionality when the true intensity has a compositional structure and automatically adapt to a low-dimensional Riemannian manifold structure of the event space. For intensity functions with a compositional structure, DNN-based NPMLEs achieve nearly minimax-optimal convergence rates without explicitly incorporating this structure into the network architecture. Simulations demonstrate that DNN-based estimators outperform kernel estimators in most settings, while manifold kernels remain competitive in some designs. Finally, we analyze stimulus-evoked neural spiking using data from the Allen Brain Observatory Visual Coding Neuropixels project. DNN-based NPMLEs provide better out-of-sample performance than a conditional kernel estimator, as evaluated by held-out log-likelihood.

Figures & tables

Appendix figures & tables15 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Feb 27, 2026

Neural Diffusion Intensity Models for Point Process Data

Cox processes model overdispersed point process data via a latent stochastic intensity, but both nonparametric estimation of the intensity model and posterior inference over intensity paths are typically intractable, relying on expensive MCMC methods. We introduce Neural Diffusion Intensity Models, a variational framework for Cox processes driven by neural SDEs. Our key theoretical result, based on enlargement of filtrations, shows that conditioning on point process observations preserves the diffusion structure of the latent intensity with an explicit drift correction. This guarantees the variational family contains the true posterior, so that ELBO maximization coincides with maximum likelihood estimation under sufficient model capacity. We design an amortized encoder architecture that maps variable-length event sequences to posterior intensity paths by simulating the drift-corrected SDE, replacing repeated MCMC runs with a single forward pass. Experiments on synthetic and real-world data demonstrate accurate recovery of latent intensity dynamics and posterior paths, with orders-of-magnitude speedups over MCMC-based methods.
Mar 25, 2026

Beyond Consistency: Inference for the Relative risk functional in Deep Nonparametric Cox Models

There remain theoretical gaps in deep neural network estimators for the nonparametric Cox proportional hazards model. In particular, it is unclear how gradient-based optimization error propagates to population risk under partial likelihood, how pointwise bias can be controlled to permit valid inference, and how ensemble-based uncertainty quantification behaves under realistic variance decay regimes. We develop an asymptotic distribution theory for deep Cox estimators that addresses these issues. First, we establish nonasymptotic oracle inequalities for general trained networks that link in-sample optimization error to population risk without requiring the exact empirical risk optimizer. We then construct a structured neural parameterization that achieves infinity-norm approximation rates compatible with the oracle bound, yielding control of the pointwise bias. Under these conditions and using the Hajek--Hoeffding projection, we prove pointwise and multivariate asymptotic normality for subsampled ensemble estimators. We derive a range of subsample sizes that balances bias correction with the requirement that the Hajek--Hoeffding projection remain dominant. This range accommodates decay conditions on the single-overlap covariance, which measures how strongly a single shared observation influences the estimator, and is weaker than those imposed in the subsampling literature. An infinitesimal jackknife representation provides analytic covariance estimation and valid Wald-type inference for relative risk contrasts such as log-hazard ratios. Finally, we illustrate the finite-sample implications of the theory through simulations and a real data application.
Nov 4, 2026

Flexible Intensities Matter: A Comprehensive Re-evaluation of Hawkes Processes and Neural Temporal Point Processes

Temporal point processes (TPPs) are the canonical model class for event sequences in continuous time, with applications ranging from seismology to electronic health records. Recent benchmarks report that neural TPPs substantially outperform their classical counterparts, such as Hawkes processes. However, these comparisons set flexible neural models against Hawkes processes in their most restricted forms and covered only a narrow range of domains. We revisit this comparison under autoregressive next-event prediction, evaluating Poisson and Hawkes processes of increasing flexibility against neural TPPs on five established benchmarks and two large-scale medical tasks derived from UK Biobank disease histories and MIMIC-IV ICU records. First, once Hawkes processes are equipped with flexible, learnable baselines and kernels, the previously reported gap to neural TPPs largely closes. Second, neural TPPs are likewise limited by their intensity parametrization: a Transformer with a spline-based intensity head outperforms previous intensity-based neural TPPs and matches or exceeds the intensity-free model. Decomposing the log-likelihood into time and type terms shows that this gain lies almost entirely in modeling when events occur (log p(t)) rather than which type occurs (log p(d|t)). Third, only on MIMIC-IV do neural TPPs retain an advantage in predicting event types, underscoring the value of complex datasets for evaluating TPPs. We release TorchPP, an open-source PyTorch framework with unified implementations of classical and neural TPPs.