Pith. sign in

Finding NEEMo: Geometric Fitting using Neural Estimation of the Energy Mover's Distance

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

A novel neural architecture was recently developed that enforces an exact upper bound on the Lipschitz constant of the model by constraining the norm of its weights in a minimal way, resulting in higher expressiveness compared to other techniques. We present a new and interesting direction for this architecture: estimation of the Wasserstein metric (Earth Mover's Distance) in optimal transport by employing the Kantorovich-Rubinstein duality to enable its use in geometric fitting applications. Specifically, we focus on the field of high-energy particle physics, where it has been shown that a metric for the space of particle-collider events can be defined based on the Wasserstein metric, referred to as the Energy Mover's Distance (EMD). This metrization has the potential to revolutionize data-driven collider phenomenology. The work presented here represents a major step towards realizing this goal by providing a differentiable way of directly calculating the EMD. We show how the flexibility that our approach enables can be used to develop novel clustering algorithms.

citation-role summary

background 1

citation-polarity summary

fields

hep-ph 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

A Step Toward Interpretability: Smearing the Likelihood

hep-ph · 2025-01-13 · conditional · novelty 6.0

Smearing the likelihood over an energy metric reveals the physical scales used by a jet classifier, and the needed smearing radius follows a power-law scaling with dataset size.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Step Toward Interpretability: Smearing the Likelihood hep-ph · 2025-01-13 · conditional · none · ref 50 · internal anchor

    Smearing the likelihood over an energy metric reveals the physical scales used by a jet classifier, and the needed smearing radius follows a power-law scaling with dataset size.