Search

The NOvA collaboration reports cross-section measurements for $\nu_{\mu}$ charged-current interactions with low hadronic energy (maximum kinetic energy of 250 MeV for protons and 175 MeV for pions) in the NOvA Near Detector. The results are presented as a double-differential cross section as a function of the direct observables of the final-state muon kinematics. Results are also presented as a single-differential cross section as a function of the derived square of the four-momentum transfer, $Q^{2}$, and as a function of the derived neutrino energy. The data correspond to an accumulated 8.09$\times10^{20}$ protons-on-target (POT) in the neutrino mode of the NuMI beam, with a narrow band of neutrino energies peaked at 1.8 GeV. The analysis provides a sample of neutrino-nucleus interactions with an enhanced fraction of quasi-elastic and two-particle-two-hole (2p2h) interactions. This enhancement allows quantitative comparisons with various nuclear models. We find strong disagreement between data and theory-based models in various regions of the muon kinematic phase space, especially in the forward muon direction., Comment: 20 pages, 12 figures

Double- and single-differential cross sections for inclusive charged-current neutrino-nucleus scattering are reported for the kinematic domain 0 to 2 GeV/c in three-momentum transfer and 0 to 2 GeV in available energy, at a mean muon-neutrino energy of 1.86 GeV. The measurements are based on an estimated 995,760 muon-neutrino CC interactions in the scintillator medium of the NOvA Near Detector. The subdomain populated by 2-particle-2-hole reactions is identified by the cross-section excess relative to predictions for neutrino-nucleus scattering that are constrained by a data control sample. Models for 2-particle-2- hole processes are rated by chi-square comparisons of the predicted-versus-measured muon-neutrino CC inclusive cross section over the full phase space and in the restricted subdomain. Shortfalls are observed in neutrino generator predictions obtained using the theory-based Val`encia and SuSAv2 2p2h models., Comment: 20 pages, 14 figures

Recent innovations from machine learning allow for data unfolding, without binning and including correlations across many dimensions. We describe a set of known, upgraded, and new methods for ML-based unfolding. The performance of these approaches are evaluated on the same two datasets. We find that all techniques are capable of accurately reproducing the particle-level spectra across complex observables. Given that these approaches are conceptually diverse, they offer an exciting toolkit for a new class of measurements that can probe the Standard Model with an unprecedented level of detail and may enable sensitivity to new phenomena.

The measurements performed by particle physics experiments must account for the imperfect response of the detectors used to observe the interactions. One approach, unfolding, statistically adjusts the experimental data for detector effects. Recently, generative machine learning models have shown promise for performing unbinned unfolding in a high number of dimensions. However, all current generative approaches are limited to unfolding a fixed set of observables, making them unable to perform full-event unfolding in the variable dimensional environment of collider data. A novel modification to the variational latent diffusion model (VLD) approach to generative unfolding is presented, which allows for unfolding of high- and variable-dimensional feature spaces. The performance of this method is evaluated in the context of semi-leptonic top quark pair production at the Large Hadron Collider., Comment: Submission to SciPost

The industrial multi-generator Wave Energy Converters (WEC) must handle multiple simultaneous waves coming from different directions called spread waves. These complex devices in challenging circumstances need controllers with multiple objectives of energy capture efficiency, reduction of structural stress to limit maintenance, and proactive protection against high waves. The Multi-Agent Reinforcement Learning (MARL) controller trained with the Proximal Policy Optimization (PPO) algorithm can handle these complexities. In this paper, we explore different function approximations for the policy and critic networks in modeling the sequential nature of the system dynamics and find that they are key to better performance. We investigated the performance of a fully connected neural network (FCN), LSTM, and Transformer model variants with varying depths and gated residual connections. Our results show that the transformer model of moderate depth with gated residual connections around the multi-head attention, multi-layer perceptron, and the transformer block (STrXL) proposed in this paper is optimal and boosts energy efficiency by an average of 22.1% for these complex spread waves over the existing spring damper (SD) controller. Furthermore, unlike the default SD controller, the transformer controller almost eliminated the mechanical stress from the rotational yaw motion for angled waves. Demo: https://tinyurl.com/yueda3jh, Comment: IJCAI 2023, Proceedings of the Thirty-Second International Joint Conference on Artificial IntelligenceAugust 2023

This Letter reports a search for charge-parity (CP) symmetry violating non-standard interactions (NSI) of neutrinos with matter using the NOvA Experiment, and examines their effects on the determination of the standard oscillation parameters. Data from $\nu_{\mu}(\bar{\nu}_{\mu})\rightarrow\nu_{\mu}(\bar{\nu}_{\mu})$ and $\nu_{\mu}(\bar{\nu}_{\mu})\rightarrow\nu_{e}(\bar{\nu}_{e})$ oscillation channels are used to measure the effect of the NSI parameters $\varepsilon_{e\mu}$ and $\varepsilon_{e\tau}$. With 90% C.L. the magnitudes of the NSI couplings are constrained to be $|\varepsilon_{e\mu}| \, \lesssim 0.3$ and $|\varepsilon_{e\tau}| \, \lesssim 0.4$. A degeneracy at $|\varepsilon_{e\tau}| \, \approx 1.8$ is reported, and we observe that the presence of NSI limits sensitivity to the standard CP phase $\delta_{\tiny\text{CP}}$.

Deep learning-based reaction predictors have undergone significant architectural evolution. However, their reliance on reactions from the US Patent Office results in a lack of interpretable predictions and limited generalization capability to other chemistry domains, such as radical and atmospheric chemistry. To address these challenges, we introduce a new reaction predictor system, RMechRP, that leverages contrastive learning in conjunction with mechanistic pathways, the most interpretable representation of chemical reactions. Specifically designed for radical reactions, RMechRP provides different levels of interpretation of chemical reactions. We develop and train multiple deep-learning models using RMechDB, a public database of radical reactions, to establish the first benchmark for predicting radical reactions. Our results demonstrate the effectiveness of RMechRP in providing accurate and interpretable predictions of radical reactions, and its potential for various applications in atmospheric chemistry.

Bayesian Optimization (BO), guided by Gaussian process (GP) surrogates, has proven to be an invaluable technique for efficient, high-dimensional, black-box optimization, a critical problem inherent to many applications such as industrial design and scientific computing. Recent contributions have introduced reinforcement learning (RL) to improve the optimization performance on both single function optimization and \textit{few-shot} multi-objective optimization. However, even few-shot techniques fail to exploit similarities shared between closely related objectives. In this paper, we combine recent developments in Deep Kernel Learning (DKL) and attention-based Transformer models to improve the modeling powers of GP surrogates with meta-learning. We propose a novel method for improving meta-learning BO surrogates by incorporating attention mechanisms into DKL, empowering the surrogates to adapt to contextual information gathered during the BO process. We combine this Transformer Deep Kernel with a learned acquisition function trained with continuous Soft Actor-Critic Reinforcement Learning to aid in exploration. This Reinforced Transformer Deep Kernel (RTDK-BO) approach yields state-of-the-art results in continuous high-dimensional optimization problems., Comment: 2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)

There is a natural probability measure on the set of isomorphism classes of principally polarized Abelian varieties of dimension $g$ over $\mathbb{F}_q$, weighted by the number of automorphisms. The distributions of the number of $\mathbb{F}_q$-rational points are related to the cohomology of fiber powers of the universal family of principally polarized Abelian varieties. To that end we compute the cohomology $H^i(\mathcal{X}^{\times n}_g,\mathbb{Q}_\ell)$ for $g=1$ using results of Eichler-Shimura and for $g=2$ using results of Lee-Weintraub and Petersen, and we compute the compactly supported Euler characteristics $e_\mathrm{c}(\mathcal{X}^{\times n}_g,\mathbb{Q}_\ell)$ for $g=3$ using results of Hain and conjectures of Bergstr\"om-Faber-van der Geer. In each of these cases we identify the range in which the point counts $\#\mathcal{X}^{\times n}_g(\mathbb{F}_q)$ are polynomial in $q$. Using results of Borel and Grushevsky-Hulek-Tommasi on cohomological stability, we adapt arguments of Achter-Erman-Kedlaya-Wood-Zureick-Brown to pose a conjecture about the asymptotics of the point counts $\#\mathcal{X}^{\times n}_g(\mathbb{F}_q)$ in the limit $g\rightarrow\infty$., Comment: 29 pages, comments welcome!

Reconstructing unstable heavy particles requires sophisticated techniques to sift through the large number of possible permutations for assignment of detector objects to the underlying partons. Anapproach based on a generalized attention mechanism, symmetry preserving attention networks (SPA-NET), has been previously applied to top quark pair decays at the Large Hadron Collider which produce only hadronic jets. Here we extend the SPA-NET architecture to consider multiple input object types, such as leptons, as well as global event features, such as the missing transverse momentum. Inaddition, we provide regression and classification outputs to supplement the parton assignment. We explore the performance of the extended capability of SPA-NET in the context of semi-leptonic decays of top quark pairs as well as top quark pairs produced in association with a Higgs boson. We find significant improvements in the power of three representative studies: a search for ttH, a measurement of the top quark mass, and a search for a heavy Z' decaying to top quark pairs. We present ablation studies to provide insight on what the network has learned in each case., Comment: Accepted by Nature Communications Physics, replaced with published version

Online retailers often use third-party demand-side-platforms (DSPs) to conduct offsite advertising and reach shoppers across the Internet on behalf of their advertisers. The process involves the retailer participating in instant auctions with real-time bidding for each ad slot of their interest. In this paper, we introduce a bid optimization system that leverages the dimensional bidding function provided by most well-known DSPs for Walmart offsite display ad campaigns. The system starts by automatically searching for the optimal segmentation of the ad requests space based on their characteristics such as geo location, time, ad format, serving website, device type, etc. Then, it assesses the quality of impressions observed from each dimension based on revenue signals driven by the campaign effect. During the campaign, the system iteratively approximates the bid landscape based on the data observed and calculates the bid adjustments for each dimension. Finally, a higher bid adjustment factor is applied to dimensions with potentially higher revenue over ad spend (ROAS), and vice versa. The initial A/B test results of the proposed optimization system has shown its effectiveness of increasing the ROAS and conversion rate while reducing the effective cost per mille for ad serving.

Complex dynamical systems may exhibit multiple steady states, including time-periodic limit cycles, where the final trajectory depends on initial conditions. With tuning of parameters, limit cycles can proliferate or merge at an exceptional point. Here we ask how dynamics in the vicinity of such a bifurcation are influenced by noise. A pitchfork bifurcation can be used to induce bifurcation behavior. We model a limit cycle with the normal form of the Hopf oscillator, couple it to the pitchfork, and investigate the resulting dynamical system in the presence of noise. We show that the generating functional for the averages of the dynamical variables factorizes between the pitchfork and the oscillator. The statistical properties of the pitchfork in the presence of noise in its various regimes are investigated and a scaling theory is developed for the correlation and response functions. The analysis is done by perturbative calculations as well as numerical means. Finally, observables illustrating the coupling of a system with a limit cycle to a pitchfork are discussed and the phase-phase correlations are shown to exhibit non-diffusive behavior with universal scaling., Comment: 10 pages, 8 figures

High-energy collisions at the Large Hadron Collider (LHC) provide valuable insights into open questions in particle physics. However, detector effects must be corrected before measurements can be compared to certain theoretical predictions or measurements from other detectors. Methods to solve this \textit{inverse problem} of mapping detector observations to theoretical quantities of the underlying collision are essential parts of many physics analyses at the LHC. We investigate and compare various generative deep learning methods to approximate this inverse mapping. We introduce a novel unified architecture, termed latent variation diffusion models, which combines the latent learning of cutting-edge generative art approaches with an end-to-end variational framework. We demonstrate the effectiveness of this approach for reconstructing global distributions of theoretical kinematic quantities, as well as for ensuring the adherence of the learned posterior distributions to known physics constraints. Our unified approach achieves a distribution-free distance to the truth of over 20 times less than non-latent state-of-the-art baseline and 3 times less than traditional latent diffusion models.

The complex events observed at the NOvA long-baseline neutrino oscillation experiment contain vital information for understanding the most elusive particles in the standard model. The NOvA detectors observe interactions of neutrinos from the NuMI beam at Fermilab. Associating the particles produced in these interaction events to their source particles, a process known as reconstruction, is critical for accurately measuring key parameters of the standard model. Events may contain several particles, each producing sparse high-dimensional spatial observations, and current methods are limited to evaluating individual particles. To accurately label these numerous, high-dimensional observations, we present a novel neural network architecture that combines the spatial learning enabled by convolutions with the contextual learning enabled by attention. This joint approach, TransformerCVN, simultaneously classifies each event and reconstructs every individual particle's identity. TransformerCVN classifies events with 90\% accuracy and improves the reconstruction of individual particles by 6\% over baseline methods which lack the integrated architecture of TransformerCVN. In addition, this architecture enables us to perform several interpretability studies which provide insights into the network's predictions and show that TransformerCVN discovers several fundamental principles that stem from the standard model.

Consensus clustering aggregates partitions in order to find a better fit by reconciling clustering results from different sources/executions. In practice, there exist noise and outliers in clustering task, which, however, may significantly degrade the performance. To address this issue, we propose a novel algorithm -- robust consensus clustering that can find common ground truth among experts' opinions, which tends to be minimally affected by the bias caused by the outliers. In particular, we formalize the robust consensus clustering problem as a constraint optimization problem, and then derive an effective algorithm upon alternating direction method of multipliers (ADMM) with rigorous convergence guarantee. Our method outperforms the baselines on benchmarks. We apply the proposed method to the real-world advertising campaign segmentation and forecasting tasks using the proposed consensus clustering results based on the similarity computed via Kolmogorov-Smirnov Statistics. The accurate clustering result is helpful for building the advertiser profiles so as to perform the forecasting., Comment: 8 pages

In computational advertising, a challenging problem is how to recommend the bid for advertisers to achieve the best return on investment (ROI) given budget constraint. This paper presents a bid recommendation scenario that discovers the concavity changes in click prediction curves. The recommended bid is derived based on the turning point from significant increase (i.e. concave downward) to slow increase (convex upward). Parametric learning based method is applied by solving the corresponding constraint optimization problem. Empirical studies on real-world advertising scenarios clearly demonstrate the performance gains for business metrics (including revenue increase, click increase and advertiser ROI increase)., Comment: 10 pages

In cost-per-click (CPC) or cost-per-impression (CPM) advertising campaigns, advertisers always run the risk of spending the budget without getting enough conversions. Moreover, the bidding on advertising inventory has few connections with propensity one that can reach to target cost-per-acquisition (tCPA) goals. To address this problem, this paper presents a bid optimization scenario to achieve the desired tCPA goals for advertisers. In particular, we build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem, which leverages the bid landscape model learned from rich historical auction data using non-parametric learning. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors, which essentially deals with the data challenges commonly faced by bid landscape modeling: incomplete logs in auctions, and uncertainty due to the variation and fluctuations in advertising bidding behaviors. The bid optimization model outperforms the baseline methods on real-world campaigns, and has been applied into a wide range of scenarios for performance improvement and revenue liftup.

Recent Wave Energy Converters (WEC) are equipped with multiple legs and generators to maximize energy generation. Traditional controllers have shown limitations to capture complex wave patterns and the controllers must efficiently maximize the energy capture. This paper introduces a Multi-Agent Reinforcement Learning controller (MARL), which outperforms the traditionally used spring damper controller. Our initial studies show that the complex nature of problems makes it hard for training to converge. Hence, we propose a novel skip training approach which enables the MARL training to overcome performance saturation and converge to more optimum controllers compared to default MARL training, boosting power generation. We also present another novel hybrid training initialization (STHTI) approach, where the individual agents of the MARL controllers can be initially trained against the baseline Spring Damper (SD) controller individually and then be trained one agent at a time or all together in future iterations to accelerate convergence. We achieved double-digit gains in energy efficiency over the baseline Spring Damper controller with the proposed MARL controllers using the Asynchronous Advantage Actor-Critic (A3C) algorithm., Comment: 2022 IEEE 18th International Conference on Automation Science and Engineering (CASE) August 20-24, 2022