Score Matching for Estimating Finite Point Processes

• URL: http://arxiv.org/abs/2512.04617v1
• Date: Thu, 04 Dec 2025 09:46:48 GMT
• Title: Score Matching for Estimating Finite Point Processes
• Authors: Haoqun Cao, Yixuan Zhang, Feng Zhou,
• Abstract summary: We develop a formal framework for score matching on finite point processes via Janossy measures.<n>We introduce an (autoregressive) weighted score-matching estimator, whose statistical properties we analyze in classical parametric settings.
• Score: 11.422667985375469
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Score matching estimators have garnered significant attention in recent years because they eliminate the need to compute normalizing constants, thereby mitigating the computational challenges associated with maximum likelihood estimation (MLE).While several studies have proposed score matching estimators for point processes, this work highlights the limitations of these existing methods, which stem primarily from the lack of a mathematically rigorous analysis of how score matching behaves on finite point processes -- special random configurations on bounded spaces where many of the usual assumptions and properties of score matching no longer hold. To this end, we develop a formal framework for score matching on finite point processes via Janossy measures and, within this framework, introduce an (autoregressive) weighted score-matching estimator, whose statistical properties we analyze in classical parametric settings. For general nonparametric (e.g., deep) point process models, we show that score matching alone does not uniquely identify the ground-truth distribution due to subtle normalization issues, and we propose a simple survival-classification augmentation that yields a complete, integration-free training objective for any intensity-based point process model for spatio-temporal case. Experiments on synthetic and real-world temporal and spatio-temporal datasets, demonstrate that our method accurately recovers intensities and achieves performance comparable to MLE with better efficiency.

Related papers

• Robust Score Matching [1.2835555561822447]
  We develop a robust score matching procedure that yields consistent parameter estimates in settings where the observed data has been contaminated.<n>A special appeal of the proposed method is that it retains convexity in exponential family models.<n>Support recovery is studied in numerical experiments and on a precipitation dataset.
  arXiv  Detail & Related papers  (2025-01-09T09:46:27Z)
• Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems [1.5665889790660235]
  We explore the relationship between recent line search approaches for deep optimization and momentum directions.<n>We introduce an algorithmic framework that exploits a mix of data persistency, persistient type rules for definition of the momentum parameter and line searches.<n>The resulting algorithm provably possesses convergence under suitable assumptions.
  arXiv  Detail & Related papers  (2024-11-11T16:26:33Z)
• Is Score Matching Suitable for Estimating Point Processes? [3.496184112204039]
  Some existing works have proposed score matching estimators for point processes. This work introduces the weighted score matching estimator to point processes. Experimental results indicate that our estimator accurately estimates model parameters on synthetic data and yields results consistent with MLE on real data.
  arXiv  Detail & Related papers  (2024-10-05T05:10:20Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• A Tale of Sampling and Estimation in Discounted Reinforcement Learning [50.43256303670011]
  We present a minimax lower bound on the discounted mean estimation problem. We show that estimating the mean by directly sampling from the discounted kernel of the Markov process brings compelling statistical properties.
  arXiv  Detail & Related papers  (2023-04-11T09:13:17Z)
• Statistical Efficiency of Score Matching: The View from Isoperimetry [96.65637602827942]
  We show a tight connection between statistical efficiency of score matching and the isoperimetric properties of the distribution being estimated. We formalize these results both in the sample regime and in the finite regime.
  arXiv  Detail & Related papers  (2022-10-03T06:09:01Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• Deconfounding Scores: Feature Representations for Causal Effect Estimation with Weak Overlap [140.98628848491146]
  We introduce deconfounding scores, which induce better overlap without biasing the target of estimation. We show that deconfounding scores satisfy a zero-covariance condition that is identifiable in observed data. In particular, we show that this technique could be an attractive alternative to standard regularizations.
  arXiv  Detail & Related papers  (2021-04-12T18:50:11Z)
• On Maximum Likelihood Training of Score-Based Generative Models [17.05208572228308]
  We show that an objective is equivalent to maximum likelihood for certain choices of mixture weighting. We show that both maximum likelihood training and test-time log-likelihood evaluation can be achieved through parameterization of the score function alone.
  arXiv  Detail & Related papers  (2021-01-22T18:22:29Z)
• Nonparametric Score Estimators [49.42469547970041]
  Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models. We provide a unifying view of these estimators under the framework of regularized nonparametric regression. We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
  arXiv  Detail & Related papers  (2020-05-20T15:01:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.