A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Enhanced latent spaces improve collider simulation precision.
Efficient event generation for collider phenomenology using parallel Langevin sampling and learned Stein diagnostics.
High-precision machine learning reduces particle physics simulations by orders of magnitude.
LOT framework speeds up event distance computation in collider physics.
Collider regression improves predictive performance in regression tasks.
Combining multiple collider events improves machine learning performance.
Improved particle-flow event reconstruction for future colliders using scalable neural networks.
New algorithm learns any part of a Bayesian network structure efficiently.
The paper presents efficient methods for identifying causal graphs with latent variables.
New method unfolds distribution moments directly from data without binning.
Tensor networks improve b-jet classification in high-energy physics.
Physicists at the Large Hadron Collider (LHC) rely on detailed simulations of particle collisions to build expectations of what experimental data may look like under different theory modeling assumptions. Petabytes of simulated data are needed to develop analysis techniques, though they are expensive to generate using …
Efficiently searches ancestral graphs using multivariate information.
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…
Foundation models trained on collider data improve jet generation tasks.
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…
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.
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 information theory to uncover causal relationships in complex systems.
Precise scientific analysis in collider-based particle physics is possible because of complex simulations that connect fundamental theories to observable quantities. The significant computational cost of these programs limits the scope, precision, and accuracy of Standard Model measurements and searches for new phenome…
Machine learning boosts physics research, especially at high energy experiments.
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.
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 …
BCAE-2D compresses 3D data from a time projection chamber at high speed.
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…
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.
FAT-GAN simulates electron-proton scattering without theoretical assumptions.
We develop, discuss, and compare several inference techniques to constrain theory parameters in collider experiments. By harnessing the latent-space structure of particle physics processes, we extract extra information from the simulator. This augmented data can be used to train neural networks that precisely estimate …
New neural method calculates EMD for particle physics data.
NSBI approach detects Higgs trilinear coupling with high luminosity upgrade constraints.
Challenge uses unsupervised learning to detect new physics signals at LHC.
Study moduli space of quadratic differentials with new geometric insights.
Deep Gaussian Processes model functions on DAGs with partially observed data.
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.
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.
We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore when two (or more) players select the same action this results in a maximal loss. We prove the first -type regret guarantee for th…
Geometric arbitrage theory reformulates a generic asset model possibly allowing for arbitrage by packaging all asset and their forward dynamics into a stochastic principal fibre bundle, with a connection whose parallel transport encodes discounting and portfolio rebalancing, and whose curvature measures, in this geomet…
Collimated streams of particles produced in high energy physics experiments are organized using clustering algorithms to form jets. To construct jets, the experimental collaborations based at the Large Hadron Collider (LHC) primarily use agglomerative hierarchical clustering schemes known as sequential recombination. W…