Improved particle-flow event reconstruction for future colliders using scalable neural networks.
problem Efficient and accurate particle reconstruction in future particle detectors.
method Comparative study of scalable machine learning models (graph neural network and kernel-based transformer) for event reconstruction.
result Graph neural network model improves jet transverse momentum resolution by up to 50%.
Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W boson identification or for quark/gluon discrimination. We explore these methods…
Visualizes futures markets using particle physics tools.
problem Understanding high-velocity data in futures markets.
method Uses ROOT, an open-source data-analysis tool, to reconstruct and visualize message-based data.
result Allows stakeholders to gain a better understanding of markets and monitor effectively.
LOT framework speeds up event distance computation in collider physics.
problem Computational inefficiency in quantifying event distances.
method Linearized Optimal Transport (LOT) for efficient computation.
result LOT significantly reduces computational cost without sacrificing accuracy.
Collider regression improves predictive performance in regression tasks.
problem Discarding prior causal knowledge in regression tasks.
method Collider regression framework incorporating probabilistic causal knowledge from collider structures.
result Proves positive generalization benefit and provides closed-form estimators.
Combining multiple collider events improves machine learning performance.
problem Improving machine learning for collider physics.
method Study of single-event vs multi-event classifiers under IID assumption.
result Training single-event classifiers is more effective than multi-event classifiers.
FAT-GAN simulates electron-proton scattering without theoretical assumptions.
problem Efficiently training GANs to simulate complex particle distributions.
method Developed FAT-GAN using transformed and augmented features to improve GAN performance.
result FAT-GAN accurately reproduces electron momenta distributions in electron-proton scattering.
New algorithm learns any part of a Bayesian network structure efficiently.
problem Learning specific parts of a Bayesian network structure is computationally inefficient.
method APS-L, a new algorithm that divides V-structures into collider and non-collider types and recursively finds them in Markov blankets.
result The APSL algorithm efficiently and accurately learns any part of a Bayesian network structure.
High-precision machine learning reduces particle physics simulations by orders of magnitude.
problem Reducing computational burden in particle physics simulations.
method Developed optimal training strategies and tuned machine learning regressors, including Deep Neural Networks with skip connections and boosted decision trees.
result Significantly reduced computational time by factors of 10^3 to 10^6 over first-principles simulations.
The paper presents efficient methods for identifying causal graphs with latent variables.
problem Recovering causal graphs with latent variables while minimizing intervention costs.
method Two intervention cost models (linear and identity) are considered. Algorithms are provided for both models.
result Upper bounds on the number of interventions needed for recovery, and approximation factors for the linear cost model.
Enhanced latent spaces improve collider simulation precision.
problem Improving the precision of collider physics simulations.
method Machine learning techniques including reweighting, pre-processing, and latent space refinement.
result Sub-percent precision across various phase spaces achieved.
Machine learning has been applied to several problems in particle physics research, beginning with applications to high-level physics analysis in the 1990s and 2000s, followed by an explosion of applications in particle and event identification and reconstruction in the 2010s. In this document we discuss promising futu…
Tensor networks improve b-jet classification in high-energy physics.
problem Classifying jets from b-quarks in proton-proton collisions.
method Quantum-inspired machine learning using tensor networks.
result Optimized classification of b-jets with improved precision and speed.
Efficient event generation for collider phenomenology using parallel Langevin sampling and learned Stein diagnostics.
problem Event generation for precision collider phenomenology.
method Parallel Langevin sampling with learned Stein diagnostics.
result Relaxation time is estimated using a data-driven approach.
Challenge uses unsupervised learning to detect new physics signals at LHC.
problem Detecting new physics signals at the LHC using unsupervised machine learning.
method Developed and evaluated anomaly detection algorithms on a large dataset.
result Benchmark dataset of >1 Billion simulated LHC events for future studies.
Efficiently searches ancestral graphs using multivariate information.
problem Discovering causal relationships in graphs with latent variables.
method Greedy search-and-score algorithm with two-step approach.
result Outperforms existing methods on benchmark datasets.
Foundation models trained on collider data improve jet generation tasks.
problem Improving foundation models for jet generation tasks.
method Pre-training OmniJet-α model on AspenOpenJets dataset. result Pre-trained model improves performance on jet generation tasks with domain shift.
Deep learning has shown remarkable results for image analysis and is expected to aid individual treatment decisions in health care. To achieve this, deep learning methods need to be promoted from the level of mere associations to being able to answer causal questions. We present a scenario with real-world medical image…
Reliable data quality monitoring is a key asset in delivering collision data suitable for physics analysis in any modern large-scale High Energy Physics experiment. This paper focuses on the use of artificial neural networks for supervised and semi-supervised problems related to the identification of anomalies in the d…
We introduce jet topics: a framework to identify underlying classes of jets from collider data. Because of a close mathematical relationship between distributions of observables in jets and emergent themes in sets of documents, we can apply recent techniques in "topic modeling" to extract jet topics from data with mini…
Neyman-Pearson testing improves goodness of fit in detecting new physics.
problem Detecting small anomalies in data distributions.
method Employing Neyman-Pearson strategy with a rich parametrized family of models.
result Neyman-Pearson testing is more sensitive to small departures and unbiased towards specific anomalies.
Modern machine learning techniques can be used to construct powerful models for difficult collider physics problems. In many applications, however, these models are trained on imperfect simulations due to a lack of truth-level information in the data, which risks the model learning artifacts of the simulation. In this …
New method uses cluster shapes to improve track finding in particle collisions.
problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.
Machine learning boosts physics research, especially at high energy experiments.
problem Finding new fundamental physics in high energy experiments.
method Review of machine learning methods and applications in high energy physics.
result Modern machine learning techniques have expanded the scope of physics research.
Collider data must be corrected for detector effects ("unfolded") to be compared with many theoretical calculations and measurements from other experiments. Unfolding is traditionally done for individual, binned observables without including all information relevant for characterizing the detector response. We introduc…
Using deep neural networks for identifying physics objects at the Large Hadron Collider (LHC) has become a powerful alternative approach in recent years. After successful training of deep neural networks, examining the trained networks not only helps us understand the behaviour of neural networks, but also helps improv…
We introduce a novel implementation of a reinforcement learning (RL) algorithm which is designed to find an optimal jet grooming strategy, a critical tool for collider experiments. The RL agent is trained with a reward function constructed to optimize the resulting jet properties, using both signal and background sampl…
A key question for machine learning approaches in particle physics is how to best represent and learn from collider events. As an event is intrinsically a variable-length unordered set of particles, we build upon recent machine learning efforts to learn directly from sets of features or "point clouds". Adapting and spe…
Can you fill R^n with a froth of "soap bubbles" that meet at most n at a time? Not if they have bounded diameter, as follows from Lebesgue's Covering Theorem. We provide some related results and conjectures.
Develops a robust training framework to detect backdoor attacks in DNNs.
problem Vulnerability of DNNs to backdoor attacks by poisoned training data.
method Collider framework selects prominent samples based on geometric structures and coreset selection objective.
result Significantly reduces backdoor success rate in various poisoned datasets.
For data sets populated by a very well modeled process and by another process of unknown probability density function (PDF), a desired feature when manipulating the fraction of the unknown process (either for enhancing it or suppressing it) consists in avoiding to modify the kinematic distributions of the well modeled …
PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.
problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.
Given the lack of evidence for new particle discoveries at the Large Hadron Collider (LHC), it is critical to broaden the search program. A variety of model-independent searches have been proposed, adding sensitivity to unexpected signals. There are generally two types of such searches: those that rely heavily on simul…
The precise modeling of subatomic particle interactions and propagation through matter is paramount for the advancement of nuclear and particle physics searches and precision measurements. The most computationally expensive step in the simulation pipeline of a typical experiment at the Large Hadron Collider (LHC) is th…
We study the asymptotics of the determinant of Laplacian on a translation surface (a compact Riemann surface equipped with a conformal flat conical metric with trivial holonomy) of genus g with 2g-2 conical points of angle 4πas two conical points collide.
The majority of contemporary object-tracking approaches do not model interactions between objects. This contrasts with the fact that objects' paths are not independent: a cyclist might abruptly deviate from a previously planned trajectory in order to avoid colliding with a car. Building upon HART, a neural class-agnost…
Graph neural networks improve charged particle tracking on FPGAs.
problem Charged particle trajectory determination in high interaction density conditions.
method Graph neural networks (GNNs) embedded in tracker data as graphs, classifying edges as track segments.
result GNNs implemented on FPGAs for charged particle tracking, enabling future HL-LHC experiments.
New neural method calculates EMD for particle physics data.
problem Metric for particle collider events based on Wasserstein metric.
method Neural network architecture estimating EMD using Kantorovich-Rubinstein duality.
result Differentiable way to calculate EMD for geometric fitting.
NSBI approach detects Higgs trilinear coupling with high luminosity upgrade constraints.
problem Determining the Higgs trilinear self-coupling via off-shell Higgs production.
method Hybrid neural simulation-based inference (NSBI) incorporating SMEFT and quantum interference effects.
result NSBI achieves sensitivity close to theoretical optimum for Higgs trilinear self-coupling.
Study moduli space of quadratic differentials with new geometric insights.
problem Understanding the structure of moduli spaces of quadratic differentials.
method Using decorated marked surfaces, Abel-Jacobi map, and 3-Calabi-Yau categories.
result Fundamental group of moduli space equals kernel of Abel-Jacobi map.
Deep Gaussian Processes model functions on DAGs with partially observed data.
problem Reconstructing and inferring from partially observed functions on DAGs with noisy measurements.
method Place priors over functions on DAGs, theoretically study prior-collapse behavior, and offer a structured variational approximation.
result Almost-sure lower bounds on the preservation of input distinctions and interpretability of simulator hierarchies.
New method uses information theory to uncover causal relationships in complex systems.
problem Discovering causal relationships in multivariate systems, especially in Bayesian networks and hypergraphs.
method Partial Information Decomposition (PID) to explicitly model higher-order interactions.
result PID components reveal direct causal neighbors and collider relationships in Bayesian networks and multi-tail hyperedges in causal hypergraphs.
A class of conserved models of wealth distributions are studied where wealth (or money) is assumed to be exchanged between a pair of agents in a population like the elastically colliding molecules of a gas exchanging energy. All sorts of distributions from exponential (Boltzmann-Gibbs) to something like Gamma distribut…
DVAEs speed up calorimeter simulation for LHC data.
problem Slow calorimeter simulation in LHC experiments.
method Discrete Variational Autoencoders (DVAEs).
result Significantly faster calorimeter shower simulation.
We consider a setting where multiple players sequentially choose among a common set of actions (arms). Motivated by a cognitive radio networks application, we assume that players incur a loss upon colliding, and that communication between players is not possible. Existing approaches assume that the system is stationary…
Following closely the construction of the Schrodinger bridge, we build a new class of Stochastic Volatility Models exactly calibrated to market instruments such as for example Vanillas, options on realized variance or VIX options. These models differ strongly from the well-known local stochastic volatility models, in p…
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi diagrams and compactifications of configuration spaces. We study moving and colliding p…
Research proposes classifiers to distinguish tweets with conflicting cashtags.
problem Cryptocurrency cashtags interfere with stock company cashtags on Twitter.
method Heuristic and supervised classifiers analyzed for distinguishing tweets.
result Independent Models perform best in distinguishing tweets with conflicting cashtags.