CURTAINs Flows For Flows: Constructing Unobserved Regions with Maximum Likelihood Estimation

Debajyoti Sengupta, Samuel Klein, John Andrew Raine, Tobias Golling
5/8/2023
hep-phcs.LGhep-ex

No confident code implementation found for this paper.

Abstract

Model independent techniques for constructing background data templates using generative models have shown great promise for use in searches for new physics processes at the LHC. We introduce a major improvement to the CURTAINs method by training the conditional normalizing flow between two side-band regions using maximum likelihood estimation instead of an optimal transport loss. The new training objective improves the robustness and fidelity of the transformed data and is much faster and easier to train. We compare the performance against the previous approach and the current state of the art using the LHC Olympics anomaly detection dataset, where we see a significant improvement in sensitivity over the original CURTAINs method. Furthermore, CURTAINsF4F requires substantially less computational resources to cover a large number of signal regions than other fully data driven approaches. When using an efficient configuration, an order of magnitude more models can be trained in the same time required for ten signal regions, without a significant drop in performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sengupta2023curtains,
  title  = {CURTAINs Flows For Flows: Constructing Unobserved Regions with Maximum Likelihood Estimation},
  author = {Debajyoti Sengupta and Samuel Klein and John Andrew Raine and Tobias Golling},
  year   = {2023},
  eprint = {2305.04646},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.04646v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.04646.svg)](https://codeofpaper.com/paper/2305.04646)

Discussion