Configurational Distance Metric

• Configurational Distance Metric is a framework that quantifies differences between configurations by comparing geometric, membership, and latent properties in metric and measure spaces.
• It integrates set-theoretic formulations, metric-measure spaces, point-to-set distances, and learned descriptor methods to address invariance under permutations and rotations.
• Design principles focus on preserving singleton metrics, combining local and global structure, and utilizing higher-order features for robust and semantically meaningful comparisons.

Across the cited literature, configurations are modeled as non-empty finite subsets of a metric space, atomic environments, metric measure spaces, surfaces, graphs, or learned embeddings. Taken together, these sources suggest that a configurational distance metric is a distance construction whose arguments are configurations rather than isolated points, and whose purpose is to quantify mismatch in geometry, membership, measure, neighborhood structure, or latent arrangement. Depending on the setting, the metric may preserve a base pointwise metric on singletons, compare full pairwise distance structure, quotient out permutations and rotations, or learn a task-adapted geometry in an expanded feature space (Fujita, 2011, Ferre et al., 2015, Mémoli et al., 2018).

1. Set-theoretic and metric-measure formulations

A direct formalization of configuration appears when a configuration is identified with a non-empty finite subset $A\subseteq X$ of a metric space $(X,d)$. In that setting, the group-average distance is

$$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$

and the central average-distance-based set metric is

$$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$

The function $g$ satisfies the triangle inequality but is not a metric because $g(A,A)$ is not generally $0$. By contrast, $f$ is a metric on the collection $\mathcal{S}(X)$ of all non-empty finite subsets of $X$. It preserves the underlying geometry on singletons through $(X,d)$0, reduces to $(X,d)$1 when $(X,d)$2, and, for the discrete metric, reduces to the Jaccard distance. In this construction, only non-shared elements contribute, so configurational mismatch is controlled simultaneously by membership asymmetry and by the distances from unmatched points to the other set (Fujita, 2011).

The metric-measure-space formulation generalizes this idea from finite sets to compact metric spaces equipped with probability measures. For an mm-space $(X,d)$3, the global distance distribution is

$(X,d)$4

and the local distance distribution is

$(X,d)$5

These induce Wasserstein-based pseudometrics such as $(X,d)$6 from global distributions and $(X,d)$7 or $(X,d)$8 from local distributions. The hierarchy

$(X,d)$9

places global and local distance distributions as computable lower bounds for fuller Gromov-type configurational comparisons. At the same time, these are generally pseudometrics rather than genuine metrics, because they may vanish on nonisomorphic spaces (Mémoli et al., 2018).

2. Point-to-configuration distances and generalized metric frameworks

A different axis of generalization replaces point-to-point distance by point-to-set distance. The Scott distance on a metric space $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$0 is defined by

$$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$1

where $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$2 is the set of Scott weights. This makes $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$3 an approach space and provides a canonical point-to-configuration distance that still recovers the original metric on singletons: $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$4 The construction is tied to forward Cauchy nets, Yoneda limits, and Scott weights, and its topological coreflection yields the c-Scott topology. The latter is sandwiched between the $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$5-Scott and generalized Scott topologies,

$$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$6

so the point-to-set distance encodes not only geometric proximity but also convergence and approximation structure (Li et al., 2016).

Generalized-metric frameworks extend configurational comparison beyond the Fréchet axioms. The thesis on generalized metrics studies partial metrics, strong partial metrics, partial $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$7-$$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$8etrics, and strong partial $$g(A,B)=\frac{1}{|A||B|}\sum_{a\in A}\sum_{b\in B}d(a,b),$$9-$$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$0etrics. These allow negative distances, non-zero distances between a point and itself, and even the comparison of $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$1-tuples. A partial metric $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$2 satisfies

$$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$3

while a strong partial metric imposes the strict lower bound $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$4 for $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$5. Partial $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$6-$$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$7etrics and strong partial $$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$8-$$f(A,B)=\frac{|B\setminus A|}{|A\cup B|}\, g(A,B\setminus A)+\frac{|A\setminus B|}{|A\cup B|}\, g(A\setminus B,B).$$9etrics lift this logic to $g$0. In each case, an associated ordinary metric can be induced, so nonclassical configurational scoring functions can still be connected to standard topology, convergence, and fixed-point theory. The thesis explicitly uses DNA sequence scoring as an example of a comparative function that is not a metric but can be modeled as a strong partial metric (Assaf, 2016).

3. Learned configurational geometries in feature and embedding spaces

Configurational distance can also be learned from labeled data. In "Boosted Sparse Non-linear Distance Metric Learning" (Ma et al., 2015), the learned distance is a Mahalanobis-type metric

$g$1

or, in an adaptively expanded feature space,

$g$2

The method does not optimize distances directly. Instead, it defines a local discriminant function

$g$3

where $g$4 and $g$5 average squared Mahalanobis distances to opposite-label and same-label $g$6-nearest neighbors. The weight matrix is decomposed as

$g$7

so each rank-one PSD matrix $g$8 becomes a weak learner in a boosting procedure. Sparsity is enforced by solving a sparse eigenvalue problem,

$g$9

with a truncated power method, and nonlinearity is introduced through a hierarchical polynomial expansion in which only interactions between already-selected features and newly selected ones are added. Because every update is $g(A,A)$0 with $g(A,A)$1, the learned metric is PSD by construction; because it is a sum of rank-one terms, it is low rank; because each $g(A,A)$2 is sparse, it is element-wise sparse. The paper explicitly interprets this combination of PSD, low rank, and sparsity as making the learned metric an effective configurational descriptor (Ma et al., 2015).

Ordinal metric learning supplies a distinct learned configurational geometry. "Angular triangle distance for ordinal metric learning" (Kamal et al., 2022) introduces the normalized angular distance

$g(A,A)$3

and the Angular Triangle Distance

$g(A,A)$4

The method places ordinal categories along equally spaced directions on a half-circle and learns an $g(A,A)$5-normalized embedding in which same-class points cluster and ordinal levels are ordered by angle. The paper states that $g(A,A)$6 satisfies non-negativity, identity of indiscernibles, symmetry, and triangle inequality, and uses it within an Ordinal Triplet Network trained by MSE regression on target angular distances. A central motivation is that standard Euclidean and cosine-distance-based DML do not guarantee preservation of ordinal geometry, whereas the ATD-based construction is designed to make the embedding configuration semantically ordered (Kamal et al., 2022).

4. Atomic, molecular, geometric, and graph configurations

For atomic environments, "Permutation-invariant distance between atomic configurations" (Ferre et al., 2015) defines a functional representation of atomic positions. A configuration $g(A,A)$7 is represented by the regularized density

$g(A,A)$8

with Gaussian shape function

$g(A,A)$9

The environment distance is the $0$0 distance between densities,

$0$1

and the rotation-invariant Atomic Configuration Distance is obtained by minimizing over $0$2,

$0$3

Because the density is a sum over atoms, permutation invariance is automatic; because the infimum is taken over rotations, rotational invariance is built in. The paper proves that $0$4 is a metric on the quotient space of configurations modulo rotations and permutations, and emphasizes that, unlike RMSD, it can compare environments with different atom counts (Ferre et al., 2015).

A related molecular approach replaces alignment by spectral fingerprints. "Metrics for measuring distances in configuration spaces" (Sadeghi et al., 2013) constructs symmetric matrices $0$5 from interatomic distances, using overlap matrices, Hamiltonians, or Hessians, diagonalizes them, sorts the eigenvalues, and uses the resulting vector $0$6 as a configurational fingerprint. The Euclidean distance

$0$7

is always a metric in fingerprint space, and becomes a metric on configuration space when the fingerprint is injective up to rigid motions and permutations. The paper shows that short fingerprints can violate the coincidence axiom by leaving a nontrivial null space in the Jacobian of the fingerprint map, whereas longer fingerprints such as overlap-based $0$8-component vectors or Hessian-based $0$9 vectors appear numerically injective for the tested structures. It also proves that the global RMSD minimized over translations, rotations, and permutations is itself a metric, and reports strong empirical correlation between fingerprint distances and globally minimized RMSD (Sadeghi et al., 2013).

For surfaces and intrinsic geometry, "Geodesic Distance Descriptors" (Shamai et al., 2016) treats a shape as a metric space $f$0 with geodesic distance. The geodesic distance matrix $f$1 is factorized via its eigen-decomposition $f$2, and the Geodesic Distance Basis $f$3 is shown to be optimal in Frobenius norm for low-rank approximation of $f$4. The Geodesic Distance Descriptor is

$f$5

so that $f$6. This converts a GH-like distance-matrix alignment problem into an alignment of descriptor point clouds up to permutation $f$7 and unitary transform $f$8, providing a compact configurational representation of intrinsic metric structure (Shamai et al., 2016).

Dynamic networks form another configurational domain. "The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networks" proposes a family of distances that can be tuned to quantify structural changes occurring on a graph at different scales, from the local scale formed by the neighbors of each vertex to the largest scale that quantifies the connections between clusters, or communities; the abstract further states that the method defines a true distance and can detect configurational changes directly related to the hidden variables governing the evolution of dynamic networks (Monnig et al., 2016).

5. Higher-order simplexwise metrics for finite spaces

A substantial strengthening of configurational comparison is obtained by moving from pairwise distance distributions to higher-order simplexwise structure. "Simplexwise Distance Distributions for finite spaces with metrics and measures" (Kurlin, 2023) considers a finite metric space $f$9 of $\mathcal{S}(X)$0 unlabelled points and, for an $\mathcal{S}(X)$1-point basis sequence $\mathcal{S}(X)$2, defines an $\mathcal{S}(X)$3 from two ingredients: the matrix $\mathcal{S}(X)$4 of pairwise distances inside the basis simplex, and the matrix $\mathcal{S}(X)$5 of distances from every other point in $\mathcal{S}(X)$6 to the basis points, with the columns lexicographically sorted. Quotienting by the action of the symmetric group on the basis points yields a permutation-invariant Relative Distance Distribution. The corresponding Simplexwise Distance Distribution is

$\mathcal{S}(X)$7

an unordered multiset over all $\mathcal{S}(X)$8-subsets of $\mathcal{S}(X)$9. This construction is invariant under relabeling and, in Euclidean space, under rigid motions and reflections (Kurlin, 2023).

The paper then equips SDDs with actual metrics. At the level of individual RDDs, the max metric $X$0 combines an $X$1 comparison of basis-simplex distance matrices with a bottleneck matching distance between the column point clouds of the corresponding $X$2-matrices. At the level of whole SDDs, two metrics are defined: a Linear Assignment Cost $X$3 between the complete sets of RDDs, and an Earth Mover’s Distance $X$4 between weighted SDDs. Both satisfy the metric axioms. They are also Lipschitz continuous: if each point of $X$5 is perturbed within its $X$6-neighborhood, then

$X$7

Most importantly, $X$8 distinguishes all known non-equivalent spaces that were impossible to distinguish by simpler invariants such as pairwise distance distributions or $X$9, including explicit 4-, 5-, 6-, and 7-point counterexamples (Kurlin, 2023).

6. Failures, limitations, and recurrent design principles

Several of the cited constructions are explicitly motivated by failures of simpler distances. The average cross-distance $(X,d)$00 is not a metric because $(X,d)$01 is not generally $(X,d)$02, and the variant $(X,d)$03 is only a semi-metric because triangle inequality can fail (Fujita, 2011). In mm-space comparison, distances defined purely from global distance distributions are pseudometrics, and the paper on distance distributions gives a counterexample to the Curve Histogram Conjecture of Brinkman and Olver, showing that two noncongruent simple closed plane curves can satisfy $(X,d)$04; it also proves sphere rigidity results for Riemannian manifolds and a local injectivity result for metric graphs and point-cloud-type settings, thereby locating precisely where distributional invariants fail and where they remain decisive (Mémoli et al., 2018). In molecular fingerprinting, short eigenvalue fingerprints such as length-$(X,d)$05 constructions may violate the coincidence axiom, because distinct configurations can share identical fingerprints, whereas longer overlap- or Hessian-based fingerprints are numerically much more robust (Sadeghi et al., 2013). In ordinal deep metric learning, cosine “distance” is criticized because it does not satisfy triangle inequality, which motivates the use of ATD instead (Kamal et al., 2022).

Learned configurational metrics introduce a different family of limitations. The boosted sparse nonlinear Mahalanobis construction in sDist is formulated for binary labels, uses a non-convex sparse eigenvalue problem, depends on hyperparameters such as $(X,d)$06, $(X,d)$07, and the polynomial order cap, and can still face feature-space growth despite hierarchical expansion (Ma et al., 2015). The ordinal ATD framework assumes well-defined ordered labels and acknowledges computational overhead from triplet construction and pairing (Kamal et al., 2022). Point-to-set and generalized-metric frameworks broaden admissible behavior, but they do so by relaxing classical axioms; this suggests a trade-off between semantic adequacy and immediate compatibility with ordinary metric intuition (Li et al., 2016, Assaf, 2016).

Taken together, these works suggest several recurrent design principles. A configurational metric becomes stronger when it preserves the underlying point metric on singleton configurations, explicitly handles the symmetries of the domain, incorporates local neighborhood or local distance-distribution information rather than only global histograms, and, where appropriate, uses higher-order structures such as simplices, triplets, or rank-one geometric components. A plausible implication is that the central methodological divide is not between “analytic” and “learned” metrics, but between descriptors that compress configuration too aggressively and constructions that retain enough local or higher-order structure to satisfy, or closely approximate, a true metric on the intended configuration space.