paper-with-me

홈 › Papers

PCN: A Deep Learning Approach to Jet Tagging Utilizing Novel Graph Construction Methods and Chebyshev Graph Convolutions

2023-09-12 · Yash Semlani, Mihir Relan, Krithik Ramesh

Jet tagging is a classification problem in high-energy physics experiments that aims to identify the collimated sprays of subatomic particles, jets, from particle collisions and tag them to their emitter particle. Advances in jet tagging present opportunities for searches of new physics beyond the Standard Model. Current approaches use deep learning to uncover hidden patterns in complex collision data. However, the representation of jets as inputs to a deep learning model have been varied, and often, informative features are withheld from models. In this study, we propose a graph-based representation of a jet that encodes the most information possible. To learn best from this representation, we design Particle Chebyshev Network (PCN), a graph neural network (GNN) using Chebyshev graph convolutions (ChebConv). ChebConv has been demonstrated as an effective alternative to classical graph convolutions in GNNs and has yet to be explored in jet tagging. PCN achieves a substantial improvement in accuracy over existing taggers and opens the door to future studies into graph-based representations of jets and ChebConv layers in high-energy physics experiments. Code is available at https://github.com/YVSemlani/PCN-Jet-Tagging.

📄 PDF Abstract BibTeX arXiv:2309.08630

Code (1)

yvsemlani/pcn-jet-tagging 공식 구현 pytorch

Tasks

graph constructionGraph Neural NetworkJet TaggingTAG

Methods 이 논문이 사용한 방법론

Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited

2022-02-04 · Mingguo He, Zhewei Wei, Ji-Rong Wen

Designing spectral convolutional networks is a challenging problem in graph learning. ChebNet, one of the early attempts, approximates the spectral graph convolutions using Chebyshev polynomials. GCN simplifies ChebNet b…

GPRGraph LearningNode Classification

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach

2024-12-14 · Yichun Yang, Rong-Hua Li, Meihao Liao, Longlong Lin 외

Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clustering, and graph neural networks. Exis…

Graph Clustering

Enhanced Graph Convolutional Network with Chebyshev Spectral Graph and Graph Attention for Autism Spectrum Disorder Classification

2025-11-27 · Adnan Ferdous Ashrafi, Hasanul Kabir arxiv

ASD is a complicated neurodevelopmental disorder marked by variation in symptom presentation and neurological underpinnings, making early and objective diagnosis extremely problematic. This paper presents a Graph Convolu…

Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximation

2024-05-12 · Sidharth SS, Keerthana AR, Gokul R, Anas KP

Accurate approximation of complex nonlinear functions is a fundamental challenge across many scientific and engineering domains. Traditional neural network architectures, such as Multi-Layer Perceptrons (MLPs), often str…

Kolmogorov-Arnold Networks

Universal Graph Filter Design based on Butterworth, Chebyshev and Elliptic Functions

2022-03-28 · Zirui Ge, Haiyan Guo, Tingting Wang, Zhen Yang

Graph filters are crucial tools in processing the spectrum of graph signals. In this paper, we propose to design universal IIR graph filters with low computational complexity by using three kinds of functions, which are …