- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies nonparametric estimation of Hawkes triggering kernels when observations consist only of event counts within fixed time bins. The authors extend coarse-grained Hawkes processes (CGHPs) to a reproducing kernel Hilbert space (RKHS), deriving a representer theorem that converts the functional optimization problem into a finite-dimensional problem involving weighted integrated kernels. Experiments on synthetic datasets, together with a social media dataset, show that the proposed method outperforms INAR under coarse temporal aggregation.
Critical strengths
The absence of exact event timestamps is an important limitation in many applications. Combining CGHP’s treatment of intra-bin interactions with RKHS-based function estimation provides a useful way to recover triggering patterns beyond restrictive parametric families.
Critical weaknesses
-
The CGHP loss depends on the unknown functions through finitely many weighted integral functionals. When these functionals are bounded, the finite-dimensional representation under squared RKHS-norm regularization appears to follow from existing general representer theorems through an orthogonal decomposition argument. Then, Theorem 1 is primarily a specialization of an established principle to CGHP. The authors should clarify the substantive theoretical advance beyond this specialization. Moreover, Corollary 2 describes as positive semidefinite but directly uses .
-
The comparisons simultaneously change intra-bin modeling, function representation, and regularization. An ablation that removes while retaining the same RKHS, regularization, and hyperparameter-selection procedure is missing. Hence, the current results do not clearly establish how much improvement comes from intra-bin modeling versus regularization.
INAR is fitted using Adam, although it admits a closed-form least-squares solution.
Questions for authors
-
What conclusions or technical steps in Theorem 1 go beyond existing representer theorems for bounded linear functionals? Please also specify the conditions guaranteeing that is invertible and explain how ill-conditioning is handled in the implementation.
-
The LDU parameterization guarantees a positive determinant, but how do you ensure nonnegative baseline intensities and nonnegative conditional intensities?
-
Does the runtime advantage persist when INAR is implemented using its closed-form solution or an efficient linear algebra solver?
3 comments
Q1-b: Please also specify the conditions guaranteeing that is invertible and explain how ill-conditioning is handled in the implementation?
We sincerely thank the reviewer for identifying this important issue. The representer theorem established in Theorem 1 holds for positive semidefinite RKHS kernels. However, the optimization formulation in Corollary 2, expressed in terms of the coarse-grained kernel coefficients (or equivalently ), involves the inverse of the matrix and therefore requires to be strictly positive definite. We acknowledge that this requirement was not sufficiently clarified in the original manuscript. We will therefore revise Corollary 2 to explicitly state that the matrix is assumed to be strictly positive definite, thereby ensuring its invertibility. Furthermore, to provide a theoretical justification for this assumption, we will add the following proposition, which establishes a sufficient condition for the strict positive definiteness of in the case of shift-invariant RKHS kernels.
Proposition. Suppose that the RKHS kernel is shift-invariant and admits a spectral density that is strictly positive almost everywhere. Then, the matrix defined in Eq. (12) is strictly positive definite and hence invertible.
Proof. See Appendix G in our manuscript.
Importantly, both the Gaussian kernel used in our main experiments and the Laplace kernel considered in Table D1 satisfy the condition of this proposition, since their spectral densities are strictly positive over the entire frequency domain. Therefore, the invertibility of is theoretically guaranteed for the RKHS kernels employed in our experiments, and no modifications to the experimental methodology or results are required.
Interestingly, the reviewer's comment has also led us to identify a promising direction for future research. In Corollary 2, we formulate the estimation problem as an optimization over the coarse-grained kernel coefficients . Alternatively, it is possible to formulate the optimization directly in terms of the dual coefficients . Specifically, by using the relationship , the RKHS regularization term can be rewritten from to . This alternative formulation eliminates the need to compute and allows the estimation problem to be formulated using positive semidefinite kernels. A key remaining challenge is to develop an efficient mechanism for ensuring that the log-determinant term, for , remains well-defined during iterative optimization. Although a straightforward approach is to employ projected gradient descent, developing a more computationally efficient optimization strategy is an important direction for future research. We will add this discussion to the Conclusion.
Critical Weakness: An ablation that removes while retaining the same RKHS, regularization, and hyperparameter-selection procedure is missing. Hence, the current results do not clearly establish how much improvement comes from intra-bin modeling versus regularization.
We sincerely thank the reviewer for this important suggestion. In response, we have conducted an additional ablation study to isolate the contribution of intra-bin modeling from that of RKHS regularization. Specifically, we compared our proposed method, CGH$_{\mathrm{rkhs}}$, with an ablated variant in which the intra-bin interaction term is constrained to zero throughout the optimization, while retaining the same RKHS framework, regularization, and hyperparameter selection procedure. We evaluated the estimation error on the gamma-mixture scenario data with and . The following table shows the results:
| = 1 | = 0.5 | = 0.2 | |
|---|---|---|---|
| CGH$_{\mathrm{rkhs}}$ | 1.55 | 1.18 | 0.98 |
| CGH$_{\mathrm{rkhs}}$ () | 2.55 | 1.33 | 0.98 |
The results clearly demonstrate that the contribution of intra-bin modeling depends strongly on the temporal aggregation level. For relatively large bin widths ( and ), the ablated variant with exhibits higher estimation errors than the original CGH$_{\mathrm{rkhs}}\Delta=0.2$), the difference in estimation accuracy becomes negligible. These findings are consistent with the underlying mechanism of CGHP. When the bin width is large, intra-bin interactions contribute substantially to the observed event counts, and neglecting these interactions introduces additional estimation errors. As the bin width decreases, however, the contribution of intra-bin interactions diminishes, making their explicit modeling progressively less important. We will include these additional experimental results and the corresponding discussion in the Appendix.
Q2: how do you ensure nonnegative baseline intensities and nonnegative conditional intensities?
To ensure the non-negativity of the estimated conditional intensity, we apply post-hoc clipping to the unconstrained intensity estimator as for , while the non-negativity of the estimated baseline intensity is not enforced. The treatment of the conditional intensity is described in the second paragraph of Section 4.2. Note that when the true intensity function is larger than a small positive value , clipping the estimated intensity at does not increase the pointwise or integrated squared estimation error.
When triggering functions are allowed to take negative values, there are two major approaches to ensuring that conditional intensities are non-negative. One is to employ nonlinear Hawkes processes with non-negative link functions (e.g., Bonnet & Sangnier, 2025), which guarantee non-negativity but may entail substantially higher computational costs. The other is to apply post hoc clipping to intensity estimates obtained from linear Hawkes processes (e.g., Kim & Iwata, 2026), thereby offering greater computational efficiency while maintaining high estimation accuracy under moderate inhibition. Our method adopts the latter approach, and its effectiveness is demonstrated in the refractory scenario (Table 3 and Figure F3). Nevertheless, developing efficient nonparametric estimation methods for aggregated event data based on nonlinear Hawkes processes, particularly in regimes dominated by strong inhibition, remains an important direction for future work. We will add this discussion to the Conclusion to clarify the scope and limitations of our approach
Q3: Does the runtime advantage persist when INAR is implemented using its closed-form solution or an efficient linear algebra solver?
First, we emphasize that we do not claim our proposed method is inherently faster than INAR. Rather, our primary claim is that our method achieves greater robustness to the bin width than INAR does while remaining computationally feasible. This point is already explicitly stated in the Experiments section (lines 359–362).
To further clarify the computational trade-offs, we discuss the computational complexity of INAR in more detail. The INAR estimation problem is formulated as the minimization of the conditional least-squares objective: , where denotes the event-count vector in the -th bin. Minimizing this objective yields estimates of the baseline intensity and the triggering-kernel values . When gradient descent is employed, as in our experiments, the computational complexity of INAR is , or with fast Fourier transform (FFT) acceleration, where denotes the number of iterations required for convergence. In comparison, the computational complexity of our proposed method with FFT is . Thus, our method generally incurs higher computational costs per iteration. Nevertheless, across the four scenarios, our method required fewer iterations on average to converge, resulting in shorter observed runtimes than the gradient-descent implementation of INAR.
As the reviewer correctly points out, the INAR objective is quadratic in its parameters, allowing its minimizer to be obtained by solving a system of linear equations. Using a direct solver, the computational complexity is . This approach eliminates the dependence on the iteration count and can therefore be substantially faster than gradient descent. However, an important consideration is that direct solvers require the factorization of a matrix of size , which incurs cubic computational complexity. Even when and are individually moderate, their product can become prohibitively large. For example, when and , the resulting matrix dimension is approximately 50,000, making dense matrix factorization computationally intensive. In contrast, gradient-based methods avoid the need for such large-scale matrix factorizations and can therefore offer greater flexibility in high-dimensional or long-support settings.
We will incorporate this discussion into the manuscript to clarify the computational trade-offs between the two approaches.
We sincerely thank the reviewer for the valuable comments, to which we provide a detailed response below. In particular, we believe we can fully address the reviewer's primary concern about the paper's contribution by clarifying our position with respect to prior research.
Q1-a: What conclusions or technical steps in Theorem 1 go beyond existing representer theorems for bounded linear functionals?
As the reviewer correctly pointed out, the generalized representer theorem (Schölkopf et al., 2001) applies to regularized optimization problems in which the data-fitting terms depend on the latent functions via finitely bounded linear functionals. Theorem 1 is indeed a specialization of this general result to the coarse-grained Hawkes process (CGHP) setting.
We would like to emphasize that the principal contribution of our work is not the discovery of a new representer theorem, but rather the first demonstration that the problem of estimating Hawkes processes from aggregated event data admits a representer theorem formulation, along with the development of a concrete, computationally efficient estimation algorithm. Despite its practical importance, the analysis of aggregated event data remains relatively underexplored in the machine learning community. By establishing the applicability of kernel methods, a fundamental and widely used machine learning framework, to this challenging problem, we believe our work can help draw greater attention to this important research direction. This is precisely what we intended to convey in the Abstract and Introduction: "this is the first representer theorem for a Hawkes process model designed for aggregated event data." Our intention was to highlight the novelty of applying the representer theorem in this particular setting, rather than to claim a fundamentally new representer theorem.
Nevertheless, the reviewer's comment has made us realize that our original presentation could have been misleading about the nature of our theoretical contribution. To avoid this ambiguity, we will replace the sentences immediately preceding Theorem 1 (lines 160-161) with the following:
Theorem 1 follows by specializing the generalized representer theorem (Schölkopf et al., 2001), which applies to regularized optimization problems whose data-fitting terms depend on the latent functions through finitely bounded linear functionals.
We believe this revision will clarify the precise theoretical contribution of our work and its relationship to the existing literature. We would appreciate it if the reviewer could let us know about any remaining concerns.