In order to try to understand the trends in the performance of the MPE, the MPE likelihood was investigated on a lower level. Plots of the MPE likelihood versus the time residual of the first hit were made, for various combinations of the perpendicular distance and the total charge in the DOM.
UPDATE Dima found the solution (better and still
fast approximation of
the integral of the convoluted Pandel function) in the appendix
of a paper by Mathieu and George. This is now implemented
both in rime
and in ipdf/lilliput
(select "GaussConvolutedFastApproximation"
for the
"PEProb"
option of the I3GulliverIPDFPandel service).
The approximation is quite good, as can be seen in the plots below.
The plots below are made for different versions of Pandel or different ways to compute/approximate the integral of the PDF:
Definition of proper MPE:
MPEn(tres) = n pdf(tres) I(tres)n-1
I(tres) = tres∫∞pdf(t)dt
(Exercise for the student: prove that if pdf(tres) is
normalized to 1, then MPEn(tres) is also normalized
to 1 for all n≥1.)
For MPE with "semi-convoluted" Pandel:
MPEn(tres) = n cpandel(tres) I(tres)n-1
I(tres) = tres∫∞plainpandel(t)dt
We are most interested in the MPE behavior with semi-convoluted Pandel. From the plots it is clear that the approximation (of using the plain Pandel integral) is good enough at large distances, but that at short distances (less than 20m) the normalization of the MPE likelihood is obviously off. It was kind of expected that the normalization would be off (since we use a different pdf in I(tres)), but it was underestimated how much it would be off. Note that a constant normalization error would not be a serious problem, since this just shows up as an additive constant in the log. The real problem is that the normalization error depends on the distance from the DOM.
This distance-dependent normalization error may well explain why the Paraboloid sigma with this version of MPE gives a too optimistic resolution estimate: the minimizer finds the track which passes as close by as many DOMs as possible with a slightly negative tres, and for the tracks on the paraboloid grid the DOMs are probably on average further away, so that the MPE normalization errors are smaller, which makes the the MPE minimum seem steeper.
The integral I(tres) of the plain Pandel function is equal to 1.0 for negative tres, and decreases at positive tres values. For DOMs with very large NPE, the decrease from 1.0 to <1.0 results in a sudden drop in MPE. Moreover, at small distances, the Pandel function is strongly peaked, so the integral I(res) also decreases very quickly. These two effects makes MPE at tres=0 so steep that it looks like it has a discontinuity. Even for NPE=2 the sudden decrease looks like a discontinuity.
Discontinuities are bad for the reconstruction, the likelihood landscape should be as smooth as possible. For large charges, the exact MPE would also force nearby tracks to have an even more negative time residual for the first hit, but for modest NPE values the (apparent) discontinuity will hamper the reconstruction process.
This might explain why the MPE reconstruction performs well at high energies, but has slightly worse performance than SPE at low energies.
The above described problems are not very critical, but they degrade the MPE performance and should be addressed. They are also in a way embarassing, because convoluted Pandel was designed precisely in order to eliminate problems at tres=0; and by using "semi"-convoluted Pandel we have reintroduced them.
We have tried out semi-convoluted Pandel as an attempt to get a fast MPE reconstruction: computing the integral of the Gauss convoluted Pandel is CPU intensive. An alternative approach is to use the box-convoluted Pandel, as defined above. One could think of this PDF as taking for each tres the average of the plain Pandel PDF over an interval [tres-jitter/2,tres+jitter/2].
The curves in the plots (right column) look a little odd at first, but when you think about it, it's clear that they should look like this. At short distances the distributions still have a steep edges (at tres=jitter/2, because that's where tres=jitter/2=2ns falls out of the "averaging window"), but not as severe as semi-convoluted Pandel, because MPE with box-convoluted Pandel is actually correctly normalized. The drawback is that like plain Pandel, there is a start of the distribution at tres=-jitter/2=-2ns, though it is rounded, not sharp, so it's still better than plain Pandel.
The problem seems to be solved using Mathieu/George/Dima's approximation for the integral of the convoluted Pandel function. Yay!
There are roughly three strategies we can pursue:
The consensus in Madison is that the last option seems the most reasonable. I am pursuing this right now. Unfortunately I found that the existing code for Pandel table generation and lookup code in ipdf needed quite some work, but I'm making progress. Once I'm done I'll post some new plots.
Distance | plain, unconvoluted Pandel | NEW Gauss-convoluted Pandel with "FastApproximation" integral | Gauss "semi-convoluted" Pandel | "box"-convoluted Pandel |
5m |
![]() |
![]() |
![]() |
![]() |
10m |
![]() |
![]() |
![]() |
![]() |
20m |
![]() |
![]() |
![]() |
![]() |
40m |
![]() |
![]() |
![]() |
![]() |
80m |
![]() |
![]() |
![]() |
![]() |