SearcharxivSearch

arXiv subjects

Ranit Das

Publications and source records attributed to Ranit Das.

11 recordsLinked to original sources

NAE, Statistically

Searches for new physics using neural anomaly scores have transformative potential, but suffer from a lack of statistical interpretability. The normalized autoencoder (NAE) provides a probabilistic interpretation of the standard bottleneck architecture, tying the anomaly score to a learned likelihood. We validate this relation for a toy model, test it for jets using a dual-NAE setup, and show how a Bayesian NAE learns this likelihood with an uncertainty.

hep-ph

Kitchen Sink Anomaly Detection

An enormous amount of R&D effort has resulted in many new resonant anomaly detection methods being proposed in recent years. However, the vast majority of previous R&D studies have suffered from two limitations: they have focused on a very small set of simulated signal benchmark models; and they have either used small sets of carefully crafted high-level jet substructure observables, which can be highly performant but are prone to model dependence, or the full collider event phase space, which is more agnostic but suffers from reduced sensitivity. In this work, we address both limitations: we formulate a number of new simulated signal benchmarks, which we make publicly available in a format fully compatible with the LHCO R&D benchmark; and we explore a high-level, yet highly agnostic, observable set consisting of Energy Flow Polynomials in addition to the usual subjettiness variables. We evaluate this "kitchen sink" observable set for both an idealized anomaly detector and the CWoLa hunting task, along with three baseline observable sets (the Baseline LHC Olympics set, subjettiness observables, and Energy Flow Polynomials). We find that our kitchen sink approach is the most sensitive to a broad range of signal types. Furthermore, we show that an attribute bagging variant, in which each ensemble member is trained on a random subset of substructure observables, yields comparable anomaly detection performance while significantly reducing training cost.

hep-ph

SURFing to the Fundamental Limit of Jet Tagging

Beyond the practical goal of improving search and measurement sensitivity through better jet tagging algorithms, there is a deeper question: what are their upper performance limits? Generative surrogate models with learned likelihood functions offer a new approach to this problem, provided the surrogate correctly captures the underlying data distribution. In this work, we introduce the SUrrogate ReFerence (SURF) method, a new approach to validating generative models. This framework enables exact Neyman-Pearson tests by training the target model on samples from another tractable surrogate, which is itself trained on real data. We argue that the EPiC-FM generative model is a valid surrogate reference for JetClass jets and apply SURF to show that modern jet taggers may already be operating close to the true statistical limit. By contrast, we find that autoregressive GPT models unphysically exaggerate top vs. QCD separation power encoded in the surrogate reference, implying that they are giving a misleading picture of the fundamental limit.

hep-ph

Generator Based Inference (GBI)

Statistical inference in physics is often based on samples from a generator (sometimes referred to as a ``forward model") that emulate experimental data and depend on parameters of the underlying theory. Modern machine learning has supercharged this workflow to enable high-dimensional and unbinned analyses to utilize much more information than ever before. We propose a general framework for describing the integration of machine learning with generators called Generator Based Inference (GBI). A well-studied special case of this setup is Simulation Based Inference (SBI) where the generator is a physics-based simulator. In this work, we examine other methods within the GBI toolkit that use data-driven methods to build the generator. In particular, we focus on resonant anomaly detection, where the generator describing the background is learned from sidebands. We show how to perform machine learning-based parameter estimation in this context with data-derived generators. This transforms the statistical outputs of anomaly detection to be directly interpretable and the performance on the LHCO community benchmark dataset establishes a new state-of-the-art for anomaly detection sensitivity.

hep-ph

Accurate and robust methods for direct background estimation in resonant anomaly detection

Resonant anomaly detection methods have great potential for enhancing the sensitivity of traditional bump hunt searches. A key component of these methods is a high quality background template used to produce an anomaly score. Using the LHC Olympics R&D dataset, we demonstrate that this background template can also be repurposed to directly estimate the background expectation in a simple cut and count setup. In contrast to a traditional bump hunt, no fit to the invariant mass distribution is needed, thereby avoiding the potential problem of background sculpting. Furthermore, direct background estimation allows working with large background rejection rates, where resonant anomaly detection methods typically show their greatest improvement in significance.

hep-ph

SIGMA: Single Interpolated Generative Model for Anomalies

A key step in any resonant anomaly detection search is accurate modeling of the background distribution in each signal region. Data-driven methods like CATHODE accomplish this by training separate generative models on the complement of each signal region, and interpolating them into their corresponding signal regions. Having to re-train the generative model on essentially the entire dataset for each signal region is a major computational cost in a typical sliding window search with many signal regions. Here, we present SIGMA, a new, fully data-driven, computationally-efficient method for estimating background distributions. The idea is to train a single generative model on all of the data and interpolate its parameters in sideband regions in order to obtain a model for the background in the signal region. The SIGMA method significantly reduces the computational cost compared to previous approaches, while retaining a similar high quality of background modeling and sensitivity to anomalous signals.

hep-ph

Residual ANODE

We present R-ANODE, a new method for data-driven, model-agnostic resonant anomaly detection that raises the bar for both performance and interpretability. The key to R-ANODE is to enhance the inductive bias of the anomaly detection task by fitting a normalizing flow directly to the small and unknown signal component, while holding fixed a background model (also a normalizing flow) learned from sidebands. In doing so, R-ANODE is able to outperform all classifier-based, weakly-supervised approaches, as well as the previous ANODE method which fit a density estimator to all of the data in the signal region instead of just the signal. We show that the method works equally well whether the unknown signal fraction is learned or fixed, and is even robust to signal fraction misspecification. Finally, with the learned signal model we can sample and gain qualitative insights into the underlying anomaly, which greatly enhances the interpretability of resonant anomaly detection and offers the possibility of simultaneously discovering and characterizing the new physics that could be hiding in the data.

hep-ph

How to Understand Limitations of Generative Networks

Well-trained classifiers and their complete weight distributions provide us with a well-motivated and practicable method to test generative networks in particle physics. We illustrate their benefits for distribution-shifted jets, calorimeter showers, and reconstruction-level events. In all cases, the classifier weights make for a powerful test of the generative network, identify potential problems in the density estimation, relate them to the underlying physics, and tie in with a comprehensive precision and uncertainty treatment for generative networks.

hep-ph

Feature Selection with Distance Correlation

Choosing which properties of the data to use as input to multivariate decision algorithms -- a.k.a. feature selection -- is an important step in solving any problem with machine learning. While there is a clear trend towards training sophisticated deep networks on large numbers of relatively unprocessed inputs (so-called automated feature engineering), for many tasks in physics, sets of theoretically well-motivated and well-understood features already exist. Working with such features can bring many benefits, including greater interpretability, reduced training and run time, and enhanced stability and robustness. We develop a new feature selection method based on Distance Correlation (DisCo), and demonstrate its effectiveness on the tasks of boosted top- and $W$-tagging. Using our method to select features from a set of over 7,000 energy flow polynomials, we show that we can match the performance of much deeper architectures, by using only ten features and two orders-of-magnitude fewer model parameters.

hep-ph

Quantum violation of macrorealism under multi-outcome two-parameter generalised measurements

Generalised dichotomic quantum measurements are fully characterised by two real parameters, dubbed as sharpness parameter and biasedness parameter. The trade-off between the degree of joint measurability, sharpness and biasedness of generalised measurements was known in the case of pairs of qubit observables. In the present work we generalise the notion of sharpness and biasedness measure of multi-outcome generalised measurements pertaining to multilevel systems. A trade-off between the amount of quantum mechanical (QM) violation of macrorealism (MR), sharpness and biasedness is established. Specifically we found that the minimum value of sharpness parameter, above which the QM violations of different necessary conditions of MR persist, decreases with increase in biasedness. We also analysed the effect of biasedness parameter on the magnitudes of QM violations of different necessary conditions of MR for multilevel spin systems.

quant-ph

Dark Matter from a Dark Connection

In the first part of this note, we observe that a non-Riemannian piece in the affine connection (a "dark connection") leads to an algebraically determined, conserved, symmetric 2-tensor in the Einstein field equations that is a natural dark matter candidate. The only other effect it has, is through its coupling to standard model fermions via covariant derivatives. If the local dark matter density is the result of a background classical dark connection, these Yukawa-like mass corrections are minuscule ($\sim 10^{-31}$ eV for terrestrial fermions) and {\em none} of the tests of general relativity or the equivalence principle are affected. In the second part of the note, we give dynamics to the dark connection and show how it can be re-interpreted in terms of conventional dark matter particles. The simplest way to do this is to treat it as a composite field involving scalars or vectors. The (pseudo-)scalar model naturally has a perturbative shift-symmetry and leads to versions of the Fuzzy Dark Matter (FDM) scenario that has recently become popular (eg., arXiv:1610.08297) as an alternative to WIMPs. A vector model with a ${\cal Z}_2$-parity falls into the Planckian Interacting Dark Matter (PIDM) paradigm, introduced in arXiv:1511.03278. It is possible to construct versions of these theories that yield the correct relic density, fit with inflation, and are falsifiable in the next round of CMB experiments. Our work is an explicit demonstration that the meaningful distinction is not between gravity modification and dark matter, but between theories with extra fields and those without.

astro-ph.CO