- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Heat Field Signatures (HFS), a multi-scale representation that maps irregular point clouds to smooth ambient heat fields and extracts geometric descriptors. The method combines closed-form global and local signatures with an optional learned pooling component. Experiments on synthetic and real-world point-cloud datasets show improved performance on several tasks and lower computational cost than some standard point-cloud neural-network baselines.
Critical strengths
-
The proposed representation is relatively simple, interpretable, and avoids explicit graph or mesh construction while exposing interesting multi-scale geometric quantities.
-
The empirical results are strong across several datasets, with additional advantages in computational efficiency and built-in rotation invariance.
Critical weaknesses
- A first concern is the degree of novelty and how the method is positioned relative to prior work. The ambient heat-field construction appears closely related to standard Gaussian smoothing and kernel-based density estimation. The main contribution therefore seems to lie in the geometric quantities derived from this field, their aggregation into the HFS/HDS representations, and their use for point-cloud learning. Although the paper discusses related methods such as HKS, diffusion maps, and intrinsic-dimension estimators, a more detailed comparison with prior work on Gaussian scale-space and kernel-based geometric analysis would help clarify which aspects of HFS are genuinely new.
There is also some missing literature in the section "Heat Kernels and Spectral Methods" such as prior work on defining spectral signatures on the graph Laplacian [1] and others using Fourier and wavelet analyses of the graph and Hodge Laplacians [2-4].
[1] NetLSD: Hearing the Shape of a Graph (KDD 2018, https://arxiv.org/abs/1805.10712)
[2] Graph Classification Gaussian Processes via Spectral Features (UAI 2023, https://arxiv.org/abs/2306.03770)
[3] Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexes (ICASSP 2022, https://arxiv.org/abs/2109.08728)
[4] Graph and Simplicial Complex Prediction Gaussian Process via the Hodgelet Representations (NeurIPS 2026, https://arxiv.org/abs/2505.10877)
-
The empirical evaluation is reasonably broad in terms of the number and diversity of datasets. However, many of the main benchmarks appear particularly well aligned with the type of multi-scale geometric structure that HFS is designed to capture. Evaluation on more generic point-cloud benchmarks, such as ModelNet40, ScanObjectNN, or ShapeNet, would therefore help assess the broader applicability and robustness of the method beyond these geometry-focused settings.
-
The paper explicitly mentions the use of AI. The quality of Figure 2 is not satisfactory, especially for a conference such as ICLR. The figure is also overly crowded, with little explanation of its content.
Questions for authors
-
Can Theorem 1 be extended to the data-dependent scale selection used by HFS in practice?
-
Can a finite-sample guarantee analogous to Theorem 1 be obtained for the log-Hessian eigenvalues?
-
How do the results change under normalisation-matched preprocessing and, for the synthetic datasets, matched point-cloud resolutions?
I have no other questions beyond those addressing my three concerns in the "Critical Weaknesses" section.
At the moment, I am leaning towards rejection. I would like to see these points addressed in order for me to consider increasing my score.
4 comments
Responses to Reviewer Hfpl - part 2
W1b: Missing spectral literature.
There is also some missing literature in the section "Heat Kernels and Spectral Methods"
We thank the reviewer for these references, which we have added to the "Heat kernels and spectral methods" paragraph of Section 2. They also help clarify where HFS sits. Works [1–4] build heat-kernel, spectral, Fourier or wavelet signatures from the Laplacian of a given graph or simplicial complex. They diffuse on a combinatorial structure and analyze it through its spectrum. HFS addresses a different setting: unstructured point clouds, where no such structure is given. It analyzes the ambient field generated by the samples, without constructing a graph or complex and without any eigendecomposition. NetLSD [1] offers a useful parallel. Its heat-trace signature is a scale-indexed global heat summary of a graph, while our global energy , the sum of all entries of the ambient heat-kernel matrix, is its point-cloud analogue. HFS then goes further, adding local differential geometry (dimension, anisotropy and scale transitions) at every point.
W2: Generic benchmarks (ModelNet40)
The empirical evaluation is reasonably broad in terms of the number and diversity of datasets
We thank the reviewer for this suggestion. We have added ModelNet40 (Appendix D.4), alongside the two boundary datasets already in the paper. We would also like to clarify how we chose our main benchmarks, because it reflects the core of the paper. We are classifying point clouds, not the objects they were sampled from. The natural benchmarks for this task are ones where the point set itself carries the class: the density–topology benchmarks of the multiparameter-persistence literature, and real scientific data in which the measurement is a point cloud, spanning subcellular biology, neuroscience, forestry and structural biology. Object-recognition benchmarks such as ModelNet40, ScanObjectNN and ShapeNet test a different question: each cloud is a homogeneous sample of a surface, and the label is its global silhouette. Evaluating HFS on them is a bit like judging a tool built to read heterogeneity on data constructed to have none.
Results on ModelNet40. We use the official split, 1,024 points, identical unit-ball inputs for all methods and no augmentation, averaged over three seeds:
| Method | OA (%) | mAcc (%) |
|---|---|---|
| DGCNN | 92.30 | 88.79 |
| PointMamba | 88.76 | 84.97 |
| HFS-full | 86.12 | 82.05 |
| HFS+DGCNN | 92.00 | 88.39 |
As expected, coordinate networks lead on the task they were designed for. HFS nevertheless remains competitive well outside its regime:
- Standalone HFS-full reaches 86.1%, within 2.7 points of PointMamba, using only intrinsic geometric signatures and no coordinates.
- HFS+DGCNN matches DGCNN to within 0.3 points, so adding HFS features does not degrade a strong backbone even on object recognition.
A clear division of labor. Together with the boundary datasets (IntrA and ATLAS-1), these results delineate the scope of HFS. On native point clouds, where geometry and density carry the label, HFS has the best overall performance and wide margins, such as more than doubling the accuracy of PTv2 and PointMamba on protein folds. On rigid-silhouette object recognition it is competitive but not dominant. A representation that computes intrinsic geometry should help exactly when that geometry carries the label, and this is what we observe.
Revision. Appendix D.4 now reports ModelNet40 together with the boundary datasets and discusses the scope of HFS.
W3: Pipeline figure
The quality of Figure 2 is not satisfactory
We thank the reviewer for this feedback. We first drew the pipeline figure in TikZ, but we were not satisfied with its visual quality, so we used Google Gemini to produce improved versions. Among the several candidates, the submitted PDF mistakenly included a near-final draft rather than the intended version. This use was disclosed in the AI Use Statement. In the revision, we have replaced Figure 2 with a cleaner version that has corrected labels and a simplified layout, and we now state the use of AI assistance directly in its caption. We will further simplify the figure and expand its caption for the final version, so that each stage of the pipeline is self-explanatory.
Responses to Reviewer Hfpl - part 3
Q1: Extending Theorem 1 to the data-dependent scale schedule.
Can Theorem 1 be extended to the data-dependent scale selection used by HFS in practice?
We thank the reviewer for this question. Yes: we have added this extension as Corollary 2 in Appendix A.3.
The key observation is that heat dimension varies smoothly with scale: its derivative in is the transition rate , which is bounded. This lets us upgrade Theorem 1 from a single fixed scale to a guarantee that holds simultaneously over a whole window of scales and at every sample point, at the cost of only a logarithmic factor. Any scale chosen from the data, including our , then inherits the guarantee whenever it falls in this window.
Remark 3 in Appendix A.3 then shows that, as the number of points grows, the fraction of HFS's scheduled scales inside the valid window tends to one, with only the finest and coarsest scales remaining outside. This matches the design: the finest scales record sampling structure (clustering, repulsion and local density, which are the signal on point-process benchmarks such as Processes), the intermediate scales provably recover intrinsic dimension, and the coarsest scales record global organization.
Q2: Finite-sample guarantee for the log-Hessian eigenvalues.
Can a finite-sample guarantee analogous to Theorem 1 be obtained for the log-Hessian eigenvalues?
We thank the reviewer for this question. Yes. Intuitively, the scale-normalized log-Hessian at a point is a heat-weighted local covariance: it measures how far the neighbors spread in each direction, relative to the spread of the heat kernel itself. Along the structure, the neighbors spread exactly as the kernel does, which gives an eigenvalue near ; across the structure they do not spread at all, which gives an eigenvalue near . The log-Hessian is therefore built from the same heat-weighted neighbor sums as heat dimension, only in matrix form, and the argument of Theorem 1 carries over with a matrix concentration inequality in place of the scalar one.
The two guarantees are closely linked: heat dimension is essentially the trace of the log-Hessian. Heat dimension counts the directions along which the structure extends, while the eigenvalues resolve which directions they are. We have added this extension, with its technical details, as Remark 2 in Appendix A.3.
Q3: Results under normalization-matched preprocessing and matched resolutions.
How do the results change under normalisation-matched preprocessing and, for the synthetic datasets, matched point-cloud resolutions?
We thank the reviewer for this question. In the revised Table 1, HFS receives exactly the same inputs as the deep baselines: centered, unit-ball clouds at identical point budgets, including resampled synthetic clouds. Appendix D.1 compares raw and matched inputs for all HFS variants. (We originally used raw coordinates at native resolution, the protocol of the multiparameter-persistence literature.)
Real benchmarks. Point budgets were always identical, so normalization is the only change. HFS-full:
| Allen | NeuroMorpho | FOR-species | SCOP | |
|---|---|---|---|---|
| Raw | 97.9 | 74.2 | 66.6 | 60.5 |
| Normalized | 97.9 | 74.0 | 64.1 | 58.2 |
The changes are at most 2.5 points, as expected: HFS sets its scales per cloud, so its geometric signatures are exactly invariant to translation and rescaling.
Synthetic benchmarks. HFS-full:
| Processes | Orbit5k | DisksAnnuli | |
|---|---|---|---|
| Raw, native resolution | 97.6 | 97.6 | 99.8 |
| Normalized, matched resolution | 81.1 | 92.5 | 98.0 |
Orbit5k and DisksAnnuli change modestly. On Processes, native clouds range from 105 to 321 points because intensity differs across processes. Resampling to 256 points removes this information and adds duplicate points that corrupt the fine-scale pair statistics separating clustered, random and repulsive patterns. This is why multiparameter persistence uses native resolution, and we compare against it under that protocol (Table 4). Even so, every HFS variant still exceeds all deep baselines on Processes.
Overall. Under matched inputs, HFS-full has the best overall performance in Table 1 (average rank 2.29, average gap 1.39 points), ahead of PTv2 and PointMamba.
Revision. Table 1 uses matched inputs; the Table 4 caption states the shared raw protocol; Appendix D.1 compares raw and matched HFS on all seven benchmarks.
Dear Reviewer HfpL,
As the discussion period closes tomorrow, we wanted to check whether our responses and the revised paper address your concerns, and we would be glad to clarify anything before the deadline. Thank you again for your time and constructive review.
Authors
Responses to Reviewer Hfpl - part 1
We thank the reviewer for the careful reading and constructive feedback. We address each point below; the General Response above summarizes the main revisions, including new baselines, matched-protocol experiments, a scalability study, and new theoretical results.
W1a: Novelty and relationship to Gaussian scale-space
We thank the reviewer for this thoughtful question, which goes to the heart of the paper. We agree that, up to normalization, uX is a Gaussian kernel density estimate, and we claim no novelty for the field itself. The novelty is the role the field plays. We believe this may have been obscured by our extensive comparisons with deep 3D networks, which can suggest that HFS is another point-cloud classifier competing on their terms. Its aim is different.
The contribution: an interface between geometric analysis and machine learning. Learning has repeatedly advanced when a branch of mathematics gained a practical interface to finite data: kernels opened functional analysis, persistent homology opened topology, and graph Laplacians opened spectral geometry. Differential geometry has lacked such an interface for irregular point clouds. Intrinsic dimension, anisotropy, codimension, energy dissipation and scale transitions are classical, well-understood quantities, but a point cloud has no derivatives, so these tools could not act on it directly. HFS lifts the cloud to a smooth multiscale object on which these quantities become well defined, closed-form in pairwise distances and theoretically grounded.
How this differs from classical uses of Gaussian smoothing. KDE estimates a density at a selected bandwidth. Scale-space theory (Witkin, 1983; Lindeberg, 1994) tracks image structure on a grid. Hessian filters and ridge estimators (Frangi et al., 1998; Ozertem & Erdogmus, 2011; Genovese et al., 2014) detect one structure type at a chosen scale. HFS instead characterizes every sample at every scale through geometric invariants of the field:
These readouts are not independent handcrafted features; the heat equation ties them together. For example, dheat=n+tr(2tQX)+2t∥∇loguX∥2, so heat dimension counts the directions along which the structure extends, and the log-Hessian spectrum resolves which directions they are.
The geometry, not the smoothing, carries the signal. We tested this directly. A KDE-density baseline, which uses the heat field itself without its geometric readouts, trails the best method by 21.0 points on average (average rank 9.29). HFS-full trails by only 1.39 points (average rank 2.29, the best of all methods). Gaussian smoothing alone does not explain the results; the geometric analysis does.
Strong results where the geometry matters. HFS targets native point clouds, where the point set is the measurement and its heterogeneity carries the label: neuronal arbors, subcellular distributions, LiDAR returns, protein backbones and spatial point processes. There, HFS-full outperforms PTv2 and PointMamba on all four real datasets. On protein folds it more than doubles their accuracy (58.2% vs. 27.1% and 23.8%) using Cα coordinates alone. On density-driven point patterns it reaches 97.6% (Processes) and 99.8% (DisksAnnuli) against multiparameter persistence, which models the same density–geometry interaction through topology. HFS approaches it through differential geometry.
Revision. We have added a paragraph, "Gaussian scale-space and kernel methods", to Section 2, added the KDE-density baseline to Table 1, and revised the introduction to state the geometric-interface perspective explicitly.