# Deep Learning the Effects of Photon Sensors on the Event Reconstruction Performance in an Antineutrino Detector

Authors: Chang-Wei Loh; Zhi-Qiang Qian; Rui Zhang; You-Hang Liu; De-Wen Cao; Wei Wang; Hai-Bo Yang; Ming Qi
Journal: Advances in High Energy Physics
 (2018)

---

## Abstract

We provide a fast approach incorporating the usage of deep learning for studying the effects of the number of photon sensors in an antineutrino detector on the event reconstruction performance therein. This work is a first attempt to harness the power of deep learning for detector designing and upgrade planning. Using the Daya Bay detector as a case study and the vertex reconstruction performance as the objective for the deep neural network, we find that the photomultiplier tubes (PMTs) at Daya Bay have different relative importance to the vertex reconstruction. More importantly, the vertex position resolutions for the Daya Bay detector follow approximately a multiexponential relationship with respect to the number of PMTs and, hence, the coverage. This could also assist in deciding on the merits of installing additional PMTs for future detector plans. The approach could easily be used with other objectives in place of vertex reconstruction.


---

## Body

## 1. Introduction

The choice of photon sensors such as photomultiplier tubes (PMTs), be it their expected sizes, locations, and the total number of sensors in antineutrino detectors, including Daya Bay [1], Double Chooz [2], RENO [3], and JUNO [4], are of interest as these sensors are the information gatherers through which we can identify antineutrino interaction events. This work is an attempt in using machine learning, in particular deep learning [5–7] as a way to understand how the number of PMTs in the detector influences the event reconstruction performance and extract lessons to be learned therefrom for areas such as detector designing and upgrade planning. To the best of our knowledge, this work is the first study on the efficacy of deep learning in detector designing and planning. For this work, we ask the following: suppose we are given N possible number of locations for the installation of k number of PMTs (k≤N), where should the PMTs be installed such that the event interaction vertex reconstruction is optimal or near-optimal given only these k PMTs in the detector and N possible locations? Of course, N and k could be infinite, but this is technically impossible as it would not meet the budget of a detector construction. In this work, we use deep learning on a model of the Daya Bay detector as a case study to understand the impact of PMTs on event position vertex reconstructions in a detector. The vertex is useful for studies on signal-background discriminations and the correction to the position-dependent energy response in the detector. The reconstruction of the vertices has been studied in-depth in the Daya Bay experiment using non-machine learning methods. As such, this allows us to cross-check our vertex reconstruction with deep learning with other methods in the Daya Bay before studying its potential in detector designing. Moreover, the vertex reconstruction performance is chosen as the objective since it is relatively simple for deep learning to handle for a clear understanding of the approach without involving too much experimental details. Nonetheless, experimentalists can easily substitute the vertex reconstruction performance with other objectives of interest. Beyond antineutrino detectors, sensor placements have been studied in areas ranging from water network distributions [8] to fault detections [9].The Daya Bay antineutrino detectors are liquid scintillator detectors with a physics program focusing on the precision measurement of the neutrino mixing angleθ13 with reactor antineutrinos. Each Daya Bay detector consists of three concentric cylindrical tanks: an inner acrylic vessel (IAV) containing gadolinium- (Gd-) doped liquid scintillator, an outer acrylic vessel (OAV) containing undoped liquid scintillator which surrounds the IAV, and a stainless steel vessel (SSV) which surrounds the IAV and OAV. With this design, the detectors could detect the interaction of the antineutrinos and the scintillator via inverse beta decay (IBD) reactions:(1)ν-e+p→e++n.The emitted positron then undergoes ionization processes in the liquid scintillator before annihilating with an electron producing a prompt signal with an energy deposition in the range of 1 - 8 MeV. The deposited energy is converted to scintillation photons which are then collected by the PMTs. As the positron displacement prior to the annihilation is negligible, the interaction vertex of the prompt signal can be assumed to be the antineutrino IBD interaction vertex. However, the neutron thermalizes and diffuses before being captured on either a proton or Gd with a mean capture time of ~30μs in the Gd-doped liquid scintillator and ~200μs in the undoped liquid scintillator, giving rise to a delayed signal. A total of 192 Hamamatsu R5912 8-inch PMTs [10], arranged in a layout with 8 rows and 24 columns, are installed on the vertical wall of the SSV pointing inward towards the OAV and IAV forming a total of 6% photodetector coverage. Located above and below the OAV are reflective panels that serve to redirect scintillation light towards the PMTs thereby increasing the photon collection efficiency to 12% effectively.As aforementioned, we used deep learning to perform the IBD vertex reconstruction in order to study the effects of PMTs on an event reconstruction. Deep learning is a class of machine learning, which is especially adept at leveraging large datasets to compute human-comprehensible quantities by learning the various degrees of correlations within. Notably, it can, on its own, learn to discover functional relationships from the data withouta priori given, effectively forming a mapping from the inputs to a quantity of interest. In other words, deep learning seeks to model the quantity of interest y using a vector of inputs x with DL(x,p)=y, where p are parameters of the deep network; their numerical values were found by minimizing the error between the predicted y′ and y. Deep learning machine architectures, commonly known as deep neural networks (DNN), are based on artificial neural networks [11] but deeper in terms of the number of hidden layers and are more flexible in terms of how each neuron is connected to other neurons.The ubiquity of deep learning and its significant success over traditional methods across disparate fields [12–14] in discovering patterns is surprising. However, this may well be due, in part, to that our universe operates on simple physical properties [15]. In high-energy physics, deep learning has demonstrated its prospective use in jets [16, 17], as part of the signal-background discrimination toolkit in the search for beyond the Standard Model particles [18] and Higgs bosons [19] and in neutrino physics experiments [20–24].


## 2. Recursive Search

As mentioned in Section1, we wish to search for the k most important locations corresponding to k PMTs installed therein from the N total possible locations in the detector in determining the vertex position V of events collected from the detector. N is a free parameter which could be chosen during the detector design and simulation stage. Denoting the set containing the k number of most important locations as the set Sk∗, this implies that we should find the set Sk∗ such that the vertex reconstruction error is minimized. However, finding such k locations simultaneously is a task confounded by a computation that grows exponentially with k. Alternatively, we could search for an approximation to Sk∗ by recursively finding the important PMT location one at a time, which can be achieved using deep learning. Since searching for the most important location is equivalent to searching for the most important PMT at that particular location, the phrase “k-th important PMT” will be used in this work as a shorthand for “k-th important PMT location”.Let the true position of the IBD prompt events beVtrue=xtrue,ytrue,ztrue; the predicted position using DNN as Vpred=xpred,ypred,zpred, then in a recursive search, the k-th important PMT, PMTk∗, will be the one that maximizes the improvement in the resolution σ of the residual distribution given that the (k-1) other PMTs have already been found through the recursive search, i.e., {PMTk-1∗,PMTk-2∗,…,PMT1∗}, and where the residual is Vpred-Vtrue. Namely,(2)PMTk∗=arg⁡minPk∈N∖Sk-1recuσPMTk,Sk-1recu,where Sk-1recu=PMTk-1∗,…,PMT1∗ and N is the set containing all the PMTs. Using (2), PMTs could be progressively added into a larger and larger subset S defining the best set found by the algorithm. Alternatively, one could perform a backward elimination: starting from the set with all PMTs and progressively eliminating the most “unimportant” PMT. At the conclusion of this recursive search, we obtain a curve of the event reconstruction resolution versus the number of PMTs used for the reconstruction thereof.


## 3. Deep Neural Network

In our approach utilizing DNNs, we used a Monte Carlo dataset comprising 2 million IBD prompt events obtained from a Daya Bay detector model which were randomly partitioned into a training set (1.4 million), a validation set (0.3 million), and a test set (0.3 million). The validation set is used for the early stopping of the DNN training to prevent overfitting or underfitting of the data [25]. The parameter N as defined in Section 2 would be 192 corresponding to the 192 PMT locations in the Daya Bay detector model. The charge information of the 192 PMTs is fed into the DNN as its inputs, and the output is the predicted vertex location Vpred. To train the DNN, we used the mean square error (MSE) loss function to measure the error between the predicted, and the truth vertex positions: (3)MSE=1T∑j=1Tvijpred-vijtrue2,where T is the number of events, vijpred and vijtrue are the predicted and truth values for the i-th coordinate of the j-th event vertex, respectively (i=x,y,z). The MSE was minimized to obtain the optimal DNN parameters. The minimization is typically done with a gradient descent method [26] involving the gradient of the loss function with respect to the DNN parameters, including the weights of each neuron; i.e., at each training iteration, the parameters w are updated via(4)wi=wi-γ·∂MSE∂wi,where γ is the learning rate determined by the user that controls the step length in the negative gradient direction during the training stage. When the MSE reaches minima, ∂MSE/∂wi=0. At this point, the DNN has found the needed parameter values to best reconstruct the vertex position. To train the DNN, γ starts with a value of 0.001 and is progressively multiplied a factor of 0.5 whenever the value of the loss function metric stops improving. In this manner, the DNN training will descent quickly in the direction of the minima in the early stage; with a smaller learning rate at a later stage, the training will not overshoot the minima but will descent steadily towards it. An early stopping is made during the training, whereby the training is terminated when no further improvements could be observed from the loss function value after a predetermined number of training rounds, in this case ten. Without such early stopping, the loss function value can rise again indicating that an overfitting has occurred.The efficacy of deep learning to predict the position of the IBD prompt events can be demonstrated by the residual distributions shown in Figure1 where the charge information of the 192 PMTs is fed into a DNN as its inputs. The DNN used here to obtain Vpred consists of multiple fully connected layers with ReLU [27] hidden neurons. The optimal number of layers and neurons were obtained using a tree-structured Parzen estimator [28]. The resulting network comprises three hidden layers containing 180, 148, and 148 neurons, respectively. The resolutions as obtained from the Gaussian fit to the residual distributions are 67 mm and 80 mm for (xpred-xtrue) and (zpred-ztrue), respectively.Figure 1
Residual distributions for x and z using all 192 PMT charge information.
(a)
x (b)
zA straightforward and brute force use of (2) in a recursive search using a DNN to identify PMTk∗ would be to check over all the remaining PMTs not in the optimal set Sk-1∗ and separately construct the residual distributions, picking the one giving the best resolution for a particular coordinate in Vtrue. For this brute force search, we used a DNN architecture similar to the aforementioned DNN. The input layer will contain neurons with charge information from the already-chosen PMTs, i.e., those in Sk-1recu, plus a candidate PMT, i.e., PMTk. The computation time for such a search grows quadratically with the total number of PMTs in the detector. Such a brute force search is clearly not scalable. Hence, in this work, we have also used a fast approach to approximate the brute force search but which mitigates the nonscalability of the latter.This fast approach integrates a DNN component from the autoencoder architecture [29]: a bottleneck layer with a single neuron, as shown in Figure 2. In this bottleneck DNN architecture, the remaining candidate PMTs not in Sk-1recu are forced to connect to the bottleneck neuron before being given to the fully connected layers as inputs, effectively demanding the DNN to search for the best weights associated with each of these PMTs. At the bottleneck region, the DNN computes the sum ∑wiPMTi, where i runs over the candidate PMTs, the quantity PMTi is the i-th PMT input to the DNN in the form of charge information, and the weight wi of the i-th PMT is a parameter in the DNN. When the training stage of the DNN ends, the wis would have reached their best values corresponding to a minima of the MSE. The PMT with the largest weight in magnitude indicates that the reconstruction of the position of the IBD prompt events relies the heaviest on this PMT compared to the rest of the candidate PMTs. Hence, this PMT would be our k-th important PMT, PMTk∗. Crucially, this type of DNN only needs to be trained once to identify PMTk∗) no matter the value of k, whereas the brute force DNN needs to be trained (N-k) times, once for each remaining candidate PMT.Figure 2
DNN architecture consisting of a bottleneck neuron.


## 4. Results

The heatmap in Figure3 shows the resolutions as obtained from the residual distributions corresponding to using only one PMT for training and determining the vertex location of the antineutrino IBD interaction using the brute force search. Specifically, the resolution pertaining to using each PMT is indicated by a value from the color scale. Clearly, some PMTs contain more information about the vertex position than others. The first most important PMT from the brute force search, i.e., PMT1brute∗, is chosen as the one having the smallest color value in the heatmap. The variation in resolution for the x-direction by column is due to the use of σx rather than σr. The reconstruction shows that the most important PMT is different for the x-direction and the z-direction. The heatmap pattern for the y-direction is similar to the x-direction, but with the dark region in the x-direction being the light region in the y-direction and vice versa, reflecting that x and y depend on cos⁡ϕ and sin⁡ϕ, respectively in a cylindrical coordinate system, i.e., a π/2 shift in difference between x and y.Figure 3
Resolutionσ corresponding to using each individual PMT for (a) x and (b) z, using the brute force search. In each heatmap, the circled PMT corresponds to the best resolution amongst all the 192 PMTs.
(a)
σ x P M T 1 (b)
σ z P M T 1In Figure4, the heatmap shows the weight corresponding to each PMT as obtained from the bottleneck neuron when searching for the first most important PMT. A higher weight indicates that the PMT has a larger impact on the vertex reconstruction. The PMT with the largest weight is identified as the most important PMT, PMT1bneck∗. Ideally, we would like to constrain the weights to be discrete at the bottleneck, i.e., to be either 0 or 1, where weight is 1 for the most important PMT and 0 for the rest during the training of the DNN. However, such a constraint is nondifferentiable and noncontinuous with respect to the loss function which would render DNN parameter optimization using gradient descent algorithms unfeasible. Comparing Figures 3 and 4, the brute force and the bottleneck DNN have chosen different PMTs as their most important PMTs possibly due to degeneracies in the detector. For example, in the z-direction, the PMTs at the top and bottom rings should produce the same resolution. Our suspect is that, during the training of the bottleneck DNN, some information sharing between a subset of PMTs, in which the DNN thinks their information values are similar, is unavoidable. Hence, the bottleneck neuron contains information from not one but a subset of PMTs; i.e., the importance by weights of each PMT could be partially “shared” amongst several PMTs. Further understanding of these are being conducted. Figures 5 and 6 are the results as obtained from the brute force and bottleneck DNN approach, respectively, while searching for the second most important PMT after having found the first most important PMT.Figure 4
Weights as given by the bottleneck neuron corresponding to each PMT for (a)x and (b) z using the bottleneck DNN. In each heatmap, the circled PMT corresponds to the largest weight in the heatmap amongst all the 192 PMTs, indicating that it is the most heavily used PMT in the DNN during the vertex reconstruction.
(a)
w e i g h t x P M T 1 (b)
w e i g h t z P M T 1Figure 5
Resolutionσ corresponding to using the charge information from the most important PMT as identified previously and a second candidate PMT for (a) x and (b) z. The first PMT as found by the previous round, PMT1brute∗, using the brute force search is whitened in each figure. In each of the heatmap, the circled PMT, PMT2∗, corresponds to the best resolution when considering the said PMT and the first important PMT found previously for the vertex reconstruction.
(a)
σ x P M T 2 , P M T 1 b r u t e ∗ (b)
σ z P M T 2 , P M T 1 b r u t e ∗Figure 6
Weights as given by the bottleneck neuron corresponding to using a second candidate PMT, and the most important PMT,PMT1bneck∗, as identified previously for (a) x and (b) z. PMT1bneck∗ is whitened in each figure. In each of the heatmap, the circled PMT, PMT2∗, corresponds to the largest weight amongst the remaining 191 PMTs given that the first important PMT has been identified with the bottleneck DNN.
(a)
w e i g h t x P M T 2 ∣ P M T 1 b n e c k ∗ (b)
w e i g h t z P M T 2 ∣ P M T 1 b n e c k ∗Figure7 shows the residual curve for x and z as a function of the number of PMTs used in the reconstruction. Using an Nvidia Tesla P40 GPU, we estimated that it would take about 60 days to complete the entire residual curve with the brute force search, whereas it took about one day to complete with the bottleneck DNN. Resolutions from random choice of PMTs are also included in the figures as a comparison to the result from the bottleneck DNN. An empirical fit to the bottleneck DNN results is done with a triple exponential fit. It can be clearly seen that there is a diminishing return on the improvement in the vertex resolution when adding additional PMTs to an existing set of PMTs, which is an implication of the submodular [30] nature of the Gaussian standard deviation and its relationship to the information entropy, H=logσ+0.5log(2πe). Succinctly, the submodularity of the Gaussian standard deviation, i.e., the resolution in this case shows that there is less new information that could be gained from adding a new PMT to a larger set of already-chosen PMTs than to a smaller set. As all the PMTs in the Daya Bay detector are of the same size and model, Figure 7 could also be interpreted as the residual curve being a function of the detector coverage.Figure 7
Residual curves forx (a) and z (b) as a function of the number of PMTs used in the reconstruction. The results plotted as solid squares are those from the brute force search. An empirical fit to the bottleneck DNN results was done with a triple exponential. Resolutions from random choice of PMTs are shown as empty squares. A zoom-in on the residual curves is also shown in the figures.
(a)
σ x versus number of PMTs (b)
σ z versus number of PMTs


## 5. Summary

In this work, we provide a fast approach using a deep neural network with a bottleneck neuron to uncover the effects of the number of photon sensors such as PMTs on the vertex resolutions in an antineutrino detector. The results have been compared with a random PMT search and a brute force search which yields the ideal result. Our inputs are the simulated charge information of the Daya Bay PMTs. The fast approach produces results close to those from the brute force search and fares much better than a random search. We find that the vertex resolution of the event reconstruction at the Daya Bay is approximately a multiexponentially decreasing function with respect to the number of PMTs and hence, also, the coverage. In future work, we envisage the possibility of incorporating the temporal information, i.e., the time of arrival of each photon in addition to the charge information to reconstruct the vertices. In addition, one could also study the size of the PMT needed alongside its installation location corresponding to the best event vertex reconstruction resolution. Also, a subsequent work from here would be the study of the effect of PMTs based on the event energy upon obtaining the vertex positions. Although studying the energy might need modifications to the deep network as the energy is a positive-definite quantity, the energy resolution is important when considering physics sensitivity and thereby also impacting the design of future antineutrino detectors including JUNO.In order to use the bottleneck DNN approach for new detectors in designing phases, we suggest Monte Carlo simulations using variousN. Then, one can obtain the (P,N,k) surface in the hyperspace, where P is some detector performance metric; N and k are as described in this work. Experimentalists can then decide on the (P,N,k) working point for their detector in accordance with their construction budget and the desired detector performance.



---

*Source: 7024309-2018-07-09.xml*