arXiv:2008.08604
Linearized Optimal Transport for Collider Events
원문 초록
We introduce an efficient framework for computing the distance between collider events using the tools of Linearized Optimal Transport (LOT). This preserves many of the advantages of the recently-introduced Energy Mover's Distance, which quantifies the "work" required to rearrange one event into another, while significantly reducing the computational cost. It also furnishes a Euclidean embedding amenable to simple machine learning algorithms and visualization techniques, which we demonstrate in a variety of jet tagging examples. The LOT approximation lowers the threshold for diverse applications of the theory of optimal transport to collider physics.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Guided Graph Compression for Quantum Graph Neural Networks
Interpreting Transformers for Jet Tagging
Lie-Equivariant Quantum Graph Neural Networks
Gradient-based Automatic Mixed Precision Quantization for Neural Networks On-Chip
OmniJet-$α$: The first cross-task foundation model for particle physics
SymbolNet: Neural Symbolic Regression with Adaptive Dynamic Pruning for Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.