paper-with-me

홈 › Papers

Track Seeding and Labelling with Embedded-space Graph Neural Networks

2020-06-30 · Nicholas Choma, Daniel Murnane, Xiangyang Ju, Paolo Calafiura, Sean Conlon, Steven Farrell, Prabhat, Giuseppe Cerati, Lindsey Gray, Thomas Klijnsma, Jim Kowalkowski, Panagiotis Spentzouris, Jean-Roch Vlimant, Maria Spiropulu, Adam Aurisano, Jeremy Hewes, Aristeidis Tsaris, Kazuhiro Terao, Tracy Usher

To address the unprecedented scale of HL-LHC data, the Exa.TrkX project is investigating a variety of machine learning approaches to particle track reconstruction. The most promising of these solutions, graph neural networks (GNN), process the event as a graph that connects track measurements (detector hits corresponding to nodes) with candidate line segments between the hits (corresponding to edges). Detector information can be associated with nodes and edges, enabling a GNN to propagate the embedded parameters around the graph and predict node-, edge- and graph-level observables. Previously, message-passing GNNs have shown success in predicting doublet likelihood, and we here report updates on the state-of-the-art architectures for this task. In addition, the Exa.TrkX project has investigated innovations in both graph construction, and embedded representations, in an effort to achieve fully learned end-to-end track finding. Hence, we present a suite of extensions to the original model, with encouraging results for hitgraph classification. In addition, we explore increased performance by constructing graphs from learned representations which contain non-linear metric structure, allowing for efficient clustering and neighborhood queries of data points. We demonstrate how this framework fits in with both traditional clustering pipelines, and GNN approaches. The embedded graphs feed into high-accuracy doublet and triplet classifiers, or can be used as an end-to-end track classifier by clustering in an embedded space. A set of post-processing methods improve performance with knowledge of the detector physics. Finally, we present numerical results on the TrackML particle tracking challenge dataset, where our framework shows favorable results in both seeding and track finding.

📄 PDF Abstract BibTeX arXiv:2007.00149

Code (0)

등록된 구현이 없습니다.

Tasks

Clusteringgraph constructionTriplet

Similar Papers 제목 키워드 기반

Beyond 4D Tracking: Using Cluster Shapes for Track Seeding

2020-12-08 · Patrick J. Fox, Shangqing Huang, Joshua Isaacson, Xiangyang Ju 외

Tracking is one of the most time consuming aspects of event reconstruction at the Large Hadron Collider (LHC) and its high-luminosity upgrade (HL-LHC). Innovative detector technologies extend tracking to four-dimensions …

parameter estimation

Improving path-tracking performance of an articulated tractor-trailer system using a non-linear kinematic model

2026-06-30 · Marina Murillo, Guido Sanchez, Nestor Deniz, Lucas Genzelis 외 arxiv

This paper presents a novel non-linear mathematical model of an articulated tractor-trailer system that can be used, in combination with receding horizon techniques, to improve the performance of path tracking tasks of a…

Eyes on the Parse: Using Gaze Features in Syntactic Parsing

2020-12-01 · LANTERN (COLING) 2020 12 · Abhishek Agrawal, Rudolf Rosa

In this paper, we explore the potential benefits of leveraging eye-tracking information for dependency parsing on the English part of the Dundee corpus. To achieve this, we cast dependency parsing as a sequence labelling…

Dependency Parsing

Leveraging Convolutional and Graph Networks for an Unsupervised Remote Sensing Labelling Tool

2025-08-01 · Tulsi Patel, Mark W. Jones, Thomas Redfern arxiv

Machine learning for remote sensing imaging relies on up-to-date and accurate labels for model training and testing. Labelling remote sensing imagery is time and cost intensive, requiring expert analysis. Previous labell…

Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability

2014-01-16 · Heather Patsolic, Sancar Adali, Joshua T. Vogelstein, Youngser Park 외

We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a co…

Graph Matching