Metraipolis › archive › dc_264c199226ef

Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning — arXiv:2611.03552

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03552
License (as archived)
CC0-1.0
Archived
2026-11-03T11:26:51.609Z
SHA-256 of the archived text
4d4fb3a0a496864cb94c1398184c19b6e2f94ea037974d220e60e595d5161db9
Stable URL of this page
https://metraipolis.com/documento/dc_264c199226ef

How to cite

Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning — arXiv:2611.03552 — arXiv (en), https://arxiv.org/abs/2611.03552 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_264c199226ef (Metraipolis archive dc_264c199226ef, sha256 4d4fb3a0a496864cb94c1398184c19b6e2f94ea037974d220e60e595d5161db9)
BibTeX
@misc{dc264c199226ef,
  title = {Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning — arXiv:2611.03552},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03552},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_264c199226ef; sha256 4d4fb3a0a496864cb94c1398184c19b6e2f94ea037974d220e60e595d5161db9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03552. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.03552 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:02:37.919Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).