Bulletin of the American Physical Society
APS April Meeting 2019
Volume 64, Number 3
Saturday–Tuesday, April 13–16, 2019; Denver, Colorado
Session T15: Computational Physics and Algorithms II |
Hide Abstracts |
Sponsoring Units: DPF Chair: Randy Ruchti, University of Notre Dame Room: Sheraton Plaza Court 4 |
Monday, April 15, 2019 3:30PM - 3:42PM |
T15.00001: Single Particle Identification with a Context-Enriched Convolutional Neural Network in the NOνA Experiment Ryan W Murphy In 2016, NOνA was the first HEP experiment to employ a convolutional neural network (CNN) in a physics result, using the CNN to classify neutrino events. However, the physics analyses performed by NOνA require further identification and reconstruction of particles in the interaction final states. We have developed the first implementation of a CNN for single particle classification which employs context-enhanced inputs. Using contextual information from the neutrino interaction that produces the particles provides additional information to the training, extending the capabilities of our original classifier. This implementation uses a four-tower siamese architecture for separation of independent inputs and inclusion of contextual information. This classifier distinguishes between electrons, muons, photons, pions, and protons with a global efficiency and purity of 83.7% and 83.5%, respectively. In this talk I will describe our implementation of NOνA's single particle CNN, discuss the advantages of adding context information, and provide case-studies of the applications of the classifier. |
Monday, April 15, 2019 3:42PM - 3:54PM |
T15.00002: A binned likelihood for stochastic models Carlos Argüelles, Austin Schneider, Tianlu Yuan Metrics of model goodness-of-fit, model comparisons, and model parameter estimation are the main categories of statistical problems in science. Bayesian and frequentist methods that address these questions often rely on a likelihood function, which describes the plausibility of model parameters given observed binned data. In some complex systems or experimental setups predicting the outcome of a model cannot be done analytically and Monte Carlo (MC) techniques are used. We present a new analytic likelihood construction that takes into account finite Monte Carlo uncertainties, appropriate for use in large or small statistics regimes. Our formulation has better performance than semi-analytic methods, prevents strong claims on biased statements, and results in better coverage properties than available methods. |
Monday, April 15, 2019 3:54PM - 4:06PM |
T15.00003: Neutrino Energy Reconstruction with Regression Convolutional Neural Network at DUNE Ilsoo Seong The study of neutrino oscillations is one of the primary physics goals of the DUNE experiment. The neutrino oscillations are functions of neutrino energies, hence the reconstruction of neutrino energies with high resolution is important to accomplish the successful measurements. We had developed a method to reconstruct energy taking the sum of the reconstructed track or shower and hadronic energies. This method can be limited because of the complicated event topology, low hadronic energy resolution, and invisible energy. Thus, we developed regression Convolutional Neural Networks (CNNs) to estimate electron neutrino energy with deconvoluted waveform inputs. Compared with the kinematics-based reconstruction, this method shows a significantly better energy resolution. In this talk, I will describe the methods to reconstruct neutrino energies with kinematic-based and regression CNN-based reconstructions at DUNE. |
Monday, April 15, 2019 4:06PM - 4:18PM |
T15.00004: Fast detector modeling using machine learning algorithms Walter Howard Hopkins, Sergei Chekanov, Jeremy R Love, Doug Benjamin Accurately and computationally rapidly modeling stochastic detector response for complex LHC experiments involving many particles from multiple interaction points, up to 200 interactions per proton-proton crossing in the HL-LHC requires the development of novel techniques. A study aimed at finding a fast transformation from truth level physics objects to reconstructed detector level physics objects is presented. This study used Delphes fast simulation based on an LHC-like detector geometry for inputs for machine learning (ML) algorithms, i.e. feed-forward regression neural networks, generative adversarial networks, and variational autoencoders. These ML transfer algorithms, with sufficient optimizations could have a wide range of applications to improve current detector simulations including: improving phenomenological studies by using a better detector representation, increasing the speed of creating event samples that more accurately resemble the output from Geant4-based detector simulation programs, or even speeding up fast simulations based on parametric description of LHC detector responses. |
Monday, April 15, 2019 4:18PM - 4:30PM |
T15.00005: Imaging Electrons in ATLAS Savannah J Thais Efficient and accurate electron reconstruction, identification, and calibration are critical for signal selection and uncertainty reduction in a broad range of ATLAS analyses. Traditionally, electron algorithms are built using physics-motivated, derived variables. This talk explores an alternate method for representing electrons by building images using calorimeter cells. These images can then be processed using machine learning algorithms like convolutional neural networks, yielding improved identification and calibration. |
Monday, April 15, 2019 4:30PM - 4:42PM |
T15.00006: The FTK First-Stage Tracking Board: A High Bandwidth Track Fitter for the ATLAS Trigger Todd M Seiss The FastTracKer (FTK) is a real-time pattern-recognition hardware tracker for the ATLAS experiment. FTK receives particle hit coordinates on 12 detector layers and provides best-fit helical tracks with a design latency of 100 microseconds. Fitting all possible combinations of hits becomes exponentially more complex with increasing accelerator collision rates and is not possible in real-time on CPUs given the dense environment at the LHC. To reduce the required number of fits, FTK first uses custom ASICs to perform coarse pattern recognition, then uses FPGAs to fit all combinations of hits within each pattern. This talk will cover the design and performance of the First-Stage Tracking Board (AUX), which uses 8 out of 12 layers to compute track seeds at a peak rate of 4 billion fits per second per board. The AUX computes the coarse resolution hits used for pattern matching, arranges them to allow quick lookup of full-resolution hits given a pattern, and performs linearized chi-squared fits for all combinations of hits in each pattern. The full functionality of the AUX was demonstrated with maximum-rate ATLAS data at the end of 2018, and FTK is currently under commissioning to scale to the full 128-AUX system for use in 2021. |
Monday, April 15, 2019 4:42PM - 4:54PM |
T15.00007: Wire Cell Reconstruction Studies for Liquid Argon TPC Orgho Anoronyo Neogi Wire Cell is an algorithm that can be used to reconstruct neutrino interactions in liquid argon time projection chamber (LArTPC) detectors in which the charge readout is performed by wire planes. We have performed simulations using this reconstruction algorithm for the general case of arbitrary number of wire planes with user defined geometry. We use our simulation to calculate efficiency and purity of the reconstruction for some sample charge distributions that might result from neutrino interactions. This calculation is performed while varying detector parameters such as the wire pitch, the number of wire planes, and the wire plane angles to understand the optimum configuration. |
Monday, April 15, 2019 4:54PM - 5:06PM |
T15.00008: GEARS - a Geant4 Example Application with Rich features and Small footprints Jing Liu We'd like to introduce GEARS, a Geant4 Example Application with Rich features yet Small footprint. The entire C++ coding is minimized down to a single file with about 600 SLOC. This is achieved mainly by utilizing Geant4 plain text geometry description, build-in UI commands (macros), C++ inheritance, and unconventional uses of some standard Geant4 functionalities. It is ideal for student training and fast implementation of small to medium-sized experiments. |
Monday, April 15, 2019 5:06PM - 5:18PM |
T15.00009: Neural Network Algorithms for the CMS Level-1 Muon Trigger Mugeon Kim The CMS trigger system selects interesting events from collision events in the LHC to keep the stored data to manageable size. The level-1 trigger is custom electronics designed to trigger events online very quickly and efficiently to meet tight timing requirements of microseconds to reach a decision. The current endcap muon trigger uses an external memory look-up table for the momentum assignment, and a trained Boosted Decision Tree for the algorithm. In preparation for the High Luminosity LHC, further reduction in the trigger rate is necessary in order to maintain similar thresholds in harsher conditions (higher pile-up). A more accurate assignment of the transverse momentum of muons reduces the rate coming from mismeasured lower momentum muons. Neural Networks can use a larger number of features to improve the momentum assignment and implementing neural nets directly in the FPGA logic without external memory frees us from the limitation on the number of address bits for a look-up table. I have investigated optimizing existing Neural Networks architecture. I’ll show performances for the pT resolution and the trigger rate and the optimization result for the architecture model including a robustness study of the algorithm. |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2025 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700