Search NASA⌕ Search

SEARCH · Search NASA

Results for “high-dimensional optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

291 records · Page 17

Kinematic Variables and Feature Engineering for Particle Phenomenology

Kinematic variables have been playing an important role in collider phenomenology, as they expedite discoveries of new particles by separating signal events from unwanted background events and allow for measurements of particle properties such as masses, couplings, spins, etc. For the past 10 years, an enormous number of kinematic variables have been designed and proposed, primarily for the experiments at the Large Hadron Collider, allowing for a drastic reduction of high-dimensional experimental data to lower-dimensional observables, from which one can readily extract underlying features of phase space and develop better-optimized data-analysis strategies. We review these recent developments in the area of phase space kinematics, summarizing the new kinematic variables with important phenomenological implications and physics applications. We also review recently proposed analysis methods and techniques specifically designed to leverage the new kinematic variables. As machine learning is nowadays percolating through many fields of particle physics including collider phenomenology, we discuss the interconnection and mutual complementarity of kinematic variables and machine learning techniques. We finally discuss how the utilization of kinematic variables originally developed for colliders can be extended to other high-energy physics experiments including neutrino experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

HDSense: An efficient method for ranking observable sensitivity

Identifying which observables most effectively constrain model parameters can be computationally prohibitive when considering full likelihoods of many correlated observables. This is especially important for, e.g., hadronization models, where high precision is required to interpret the results of collider experiments. We introduce the High-Dimensional Sensitivity (HDSense) score, a computationally efficient metric for ranking observable sets using only one-dimensional histograms. Derived by profiling over unknown correlations in the Fisher information framework, the score balances total information content against redundancy between observables. We apply HDSense to rank a set observables in terms of their constraining power with respect to five parameters of the Lund string model of hadronization implemented in Pythia using simulated leptonic collider events at the $Z$ pole. Validation against machine-learning--based full-likelihood approximations demonstrates that HDSense successfully identifies near-optimal observable subsets. The framework naturally handles data from multiple experiments with different acceptances and incorporates detector effects. While demonstrated on hadronization models, the methodology applies broadly to generic parameter estimation problems where correlations are unknown or difficult to model.

Assi, Benoît [Cincinnati U.] (ORCID:00000003092433↗

QBTNs - Quantum Boolean Tensor Networks

We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.

Alexandrov, Boian↗