Robust Comparison of Kernel Densities on Spherical Domains

Zhengwu Zhang, Eric Klassen, Anuj SrivastavaSankhya A 2018 · OpenReview

TL;DR

This paper introduces a novel framework for comparing probability density functions (PDFs) on spherical domains, addressing the limitations of existing methods that are sensitive to sample size and bandwidth choices. By focusing on the intrinsic "smoothness" of PDFs and using a spectral representation, they develop a robust distance metric that allows for fair comparisons across populations with varying data characteristics.

What Problem Does This Paper Address?

Analyzing data that naturally resides on a sphere (like directional data or locations) presents unique challenges in statistics. Traditional methods for estimating and comparing probability density functions (PDFs) often rely on kernel density estimation, which is highly sensitive to two key parameters: the bandwidth of the kernel and the sample size. This sensitivity makes it difficult to draw reliable conclusions when comparing populations with different sample sizes or when using different bandwidths for estimation. The paper aims to bridge this gap by developing a method that is robust to these variations, providing a more stable and meaningful way to compare spherical datasets.

Methods

The core of the paper's contribution lies in its innovative approach to comparing PDFs on spherical domains. Instead of directly comparing estimated PDFs, they propose a framework based on:

  • Spectral Representation: PDFs are represented by their coefficients with respect to the eigenfunctions of the Laplacian operator on a sphere. This is analogous to using Fourier series for functions on a circle.
  • Smoothness Quantification: The "smoothness" of a PDF is quantified by the decay rate of these spectral coefficients. This decay is directly related to the bandwidth used in kernel density estimation, but it's treated as an intrinsic property of the density itself.
  • Heat Equation Analogy: The process of increasing smoothness is modeled using the heat equation, where time in the heat equation corresponds to the bandwidth in kernel smoothing.
  • Orthogonal Sections and Geodesic Distance: They define "orthogonal sections" which are sets of PDFs with the same level of smoothness. A geodesic distance is then computed between points on these sections. This distance metric is designed to be invariant to the original bandwidth and sample size used for estimation.
  • Path Straightening Algorithm: A numerical algorithm is developed to compute this geodesic distance on the ellipsoidal manifolds representing the sections.

Datasets

The paper demonstrates its framework using simulated data on spherical domains ($S^1$ and $S^2$) and real-world datasets.

  • Simulated Data: The authors generate data from various distributions on $S^1$ and $S^2$ to evaluate their method's performance in density estimation and comparison.
  • Real Data:
    • Texture Classification: The framework is applied to compare features extracted from texture images.
  • Hurricane Data: The method is used to analyze the location distributions of hurricanes, comparing their starting points, locations after 60 hours, and ending points.

Key Insights and Ideas

  • Smoothness as an Intrinsic Property: The paper reframes the concept of bandwidth from a tuning parameter to a measure of the intrinsic smoothness of a density function. This shift allows for more robust comparisons.
  • Equivalence Classes of Smoothness: By using the heat equation and spectral representation, they create "equivalence classes" of densities that have the same smoothness level, regardless of how they were initially estimated.
  • Robustness to Sample Size and Bandwidth: The proposed geodesic distance metric, computed on these smoothness-level-matched sections, effectively negates the influence of sample size and bandwidth, leading to fairer comparisons.
  • Unified Framework for $S^1$, $S^2$, and $\mathbb{R}^n$: The method is shown to be applicable to various domains, including circles ($S^1$), spheres ($S^2$), and even Euclidean spaces ($\mathbb{R}^n$) by mapping them to spherical domains.

Key Results

  • Improved Density Comparison: The framework demonstrates a more robust comparison of densities, especially when sample sizes or bandwidths differ significantly. Figure 3 shows how densities that appear quite different at various bandwidths become much more similar after being brought to the same smoothness level.
  • Effective Two-Sample Hypothesis Testing: The geodesic distance is used as a statistic for a two-sample hypothesis test. The paper shows that this test performs well, outperforming traditional methods like KS and MMD in certain scenarios, particularly when dealing with spherical data. Figure 5 and 6 illustrate the test performance across different smoothness levels and scenarios.
  • Successful Real-World Applications:
    • In texture classification (Section 6.2), the proposed distance metric ($d_\kappa$) outperformed histogram-based comparisons and other distance metrics.
  • In hurricane data analysis (Section 6.4), the method successfully identified significant differences in hurricane location distributions based on their starting regions and development stages.

Limitations and Future Work

  • Computational Complexity: While the framework is robust, the path-straightening algorithm for computing geodesic distances can be computationally intensive, especially in higher dimensions.
  • Choice of $\kappa$: Selecting the appropriate smoothness level ($\kappa$) for comparison is crucial. The paper suggests strategies for choosing $\kappa$, but it remains a parameter that influences the results.
  • Extension to More Complex Domains: While the paper discusses extensions to $\mathbb{R}^n$, handling non-compact domains with boundaries presents technical challenges.

Future work could focus on optimizing the computational efficiency of the geodesic distance calculation and exploring more sophisticated methods for automatically selecting the optimal smoothness level $\kappa$. Further applications in other fields dealing with spherical or manifold data are also promising.

Summary updated

Abstract

While spherical data arises in many contexts, including in directional statistics, the current tools for density estimation and population comparison on spheres are quite limited. Popular approaches for comparing populations (on Euclidean domains) mostly involve a two-step procedure: (1) estimate probability density functions (pdf s) from their respective samples, most commonly using the kernel density estimator, and (2) compare pdf s using a metric such as the \(\mathbb {L}^{2}\) norm. However, both the estimated pdf s and their differences depend heavily on the chosen kernels, bandwidths, and sample sizes. Here we develop a framework for comparing spherical populations that is robust to these choices. Essentially, we characterize pdf s on spherical domains by quantifying their smoothness. Our framework uses a spectral representation, with densities represented by their coefficients with respect to the eigenfunctions of the Laplacian operator on a sphere. The change in smoothness, akin to using different kernel bandwidths, is controlled by exponential decays in coefficient values. Then we derive a proper distance for comparing pdf coefficients while equalizing smoothness levels, negating influences of sample size and bandwidth. This signifies a fair and meaningful comparisons of populations, despite vastly different sample sizes, and leads to a robust and improved performance. We demonstrate this framework using examples of variables on \(\mathbb {S}^{1}\) and \(\mathbb {S}^{2}\), and evaluate its performance using a number of simulations and real data experiments.
BibTeX
@inproceedings{zhang2018robust,
  author = {Zhengwu Zhang and Eric Klassen and Anuj Srivastava},
  title = {{Robust Comparison of Kernel Densities on Spherical Domains}},
  booktitle = {Sankhya A},
  year = {2018},
  url = {https://openreview.net/forum?id=iIaianUZ55},
}
Figure