You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I recently had to tackle a pretty complicated reco-gen level matching problem, that IMHO demonstrated that a columnar array-based language will be extremely difficult to make expressive enough.
The challenge involved building a ROC curve for a jet-tagging algo, so it involved making histograms of the discimrinator score for reconstructed jets which were matched or not to a gen-level W. The gen-level W had to be within deltaR of 0.8 but if a parent of the gen-level W was a top, the sister gen-level b quark had to be away from the W by at least deltaR of 0.8.
I'm not sure if that's a complete enough challenge description, but it was a challenge I couldn't easily build using simple jagged array manipulations, so I'm curious how we can handle this in an ADL.
The text was updated successfully, but these errors were encountered:
benkrikler
changed the title
New complex jet matching challenge
Additional complex jet matching challenge?
Nov 7, 2019
I recently had to tackle a pretty complicated reco-gen level matching problem, that IMHO demonstrated that a columnar array-based language will be extremely difficult to make expressive enough.
The challenge involved building a ROC curve for a jet-tagging algo, so it involved making histograms of the discimrinator score for reconstructed jets which were matched or not to a gen-level W. The gen-level W had to be within deltaR of 0.8 but if a parent of the gen-level W was a top, the sister gen-level b quark had to be away from the W by at least deltaR of 0.8.
I'm not sure if that's a complete enough challenge description, but it was a challenge I couldn't easily build using simple jagged array manipulations, so I'm curious how we can handle this in an ADL.
The text was updated successfully, but these errors were encountered: