Pileup involves the contamination of the energy distribution arising from the primary collision of interest (leading vertex) by radiation from soft collisions (pileup). We develop a new technique for removing this contamination using machine learning and convolutional neural networks. The network takes as input the ene…
On-device research index
arXiv research
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “particle collisions”
We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them with the collections of ordered processes in a Brownian particle system, in which …
Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectorsphysics.data-an
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%.
We study an elementary problem of the topological robotics: collective motion of a set of distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in the process of motion. The ultimate goal is to construct an algorithm which will…
Residual neural networks improve collision prediction in planetary simulations.
problem Accurate prediction of planetary collisions in N-body simulations.
method Residual neural networks trained on collision data.
result Residual neural networks outperform existing methods in prediction accuracy and generalization.
ALICE uses ML for particle identification across a wide momentum range.
problem Effective combination of detector information for particle identification.
method Machine Learning, specifically Random Forest and Domain Adaptation Neural Networks.
result Advanced ML solutions improve particle identification accuracy.
Towards a Computer Vision Particle Flowphysics.data-an
A computer vision approach improves neutral particle detection in particle flow algorithms.
problem Optimal reconstruction of particle content and kinematics in calorimeter images.
method Computer vision techniques applied to calorimeter images, using deep learning and super-resolution.
result Significantly improved reconstruction of neutral particle calorimeter energy deposits.
Beyond 4D Tracking: Using Cluster Shapes for Track Seedingphysics.ins-det
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.
We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph . We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than on time-like singular segments). We construct examples of such manifolds, d…
Supervised learning with a deep convolutional neural network is used to identify the QCD equation of state (EoS) employed in relativistic hydrodynamic simulations of heavy-ion collisions from the simulated final-state particle spectra . High-level correlations of learned by the neural network act a…
We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities of angles less than along a time-like graph . To each such space we associate a graph and a finite family of pairs of hyperbolic surfaces with cone singularities. We show that this data is sufficient …
We provide a bridge between generative modeling in the Machine Learning community and simulated physical processes in High Energy Particle Physics by applying a novel Generative Adversarial Network (GAN) architecture to the production of jet images -- 2D representations of energy depositions from particles interacting …
Equivariant neural network simplifies particle physics models.
problem Complexity and interpretability in particle physics classification.
method Lorentz group equivariant neural network architecture.
result Simplified, interpretable models with fewer parameters.
Unified approach to equity markets with open and hybrid Jacobi models.
problem Stochastic Portfolio Theory problems in equity markets.
method Combining open markets and hybrid Jacobi processes.
result Stability of capital distribution curve and growth optimal strategies.
CriticSMC improves planning efficiency in constrained environments.
problem Planning with hard constraints in dynamic environments.
method Sequential Monte Carlo with learned heuristic factors.
result CriticSMC reduces collision rates with low computational cost.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
Quantum GNNs outperform classical GNNs in jet tagging.
problem Classifying partons initiating jets from high-energy particle collisions.
method Comparison of classical and quantum GNNs and their equivariant counterparts.
result Quantum GNNs outperformed classical GNNs in binary classification tasks.
Develops scalable differentiable physics for complex object interactions.
problem Limited scalability of existing differentiable physics solvers.
method Adopting meshes for arbitrary geometry, localized collision handling, and accelerated implicit differentiation.
result Significantly reduces memory and computation requirements compared to particle-based methods.
Graph Neural Networks for Charged Particle Tracking on FPGAsphysics.ins-det
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.
Derives a fluid model for fish swarming in arbitrary dimensions.
problem Modeling fish swarming behavior in various dimensions.
method Develops a novel -dimensional model using bundle geometry and variational formulation.
result Derives the self-organized hydrodynamic model from the interacting particle system.
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 …
We discuss the equivalence between kinetic wealth-exchange models, in which agents exchange wealth during trades, and mechanical models of particles, exchanging energy during collisions. The universality of the underlying dynamics is shown both through a variational approach based on the minimization of the Boltzmann e…
MLPF: Efficient machine-learned particle-flow reconstruction using graph neural networksphysics.data-an
MLPF uses graph neural networks to improve particle-flow reconstruction in high-pileup conditions.
problem Improving particle-flow reconstruction in high-pileup conditions at high-luminosity LHC.
method End-to-end trainable machine-learned particle-flow algorithm based on graph neural networks.
result MLPF improves physics response and demonstrates scalable reconstruction in high-pileup environments.
We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph . We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than on time-like singular segments). We construct examples of such manifolds, d…
Study nonholonomic systems with collisions using variational principles.
problem Variational problems on nonholonomic systems with collisions.
method Extended variational principle, introduced connection on principal bundles, applied Lagrange–Poincaré–Pontryagin reduction.
result Implicit Lagrange–d'Alembert–Pontryagin equations for nonholonomic systems with collisions.
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.
This paper presents a spermwhale' localization architecture using jointly a bag-of-features (BoF) approach and machine learning framework. BoF methods are known, especially in computer vision, to produce from a collection of local features a global representation invariant to principal signal transformations. Our idea …
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
problem Analyzing the dynamics of nonholonomic mechanical systems with impacts.
method Variational techniques extended to nonsmooth context for collisions.
result Variational formulation for implicit nonholonomic mechanical systems with energy-momentum preserving collisions.
Model forecasts motor vehicle collision rates with high accuracy.
problem Forecasting motor vehicle collision rates with high accuracy.
method Adopted Heston Stochastic Volatility model and extended it to account for seasonality and accelerated safety periods.
result Short-term forecasts show high accuracy (over 95%) and outperform existing models.
Machine learning competition predicts spacecraft collision risks.
problem Predicting future collision risks between orbiting satellites.
method Machine learning models trained on satellite collision data.
result Models accurately predicted collision risks with high precision.
Turbo-Sim generates models from physics principles, improving interpretability and flexibility.
problem Transforming particle properties from theory to observation in collider physics.
method Maximizes mutual information between input and output, setting loss term weights.
result Mathematically interpretable and flexible generative models.
Near-optimal algorithms for private estimation and sequential testing of collision probabilitystat.ML
New algorithms estimate and test collision probability with near-optimal sample complexity.
problem Estimating and testing collision probability in discrete distributions.
method Developed algorithms for -local differential privacy and sequential testing.
result Achieved nearly optimal sample complexity for estimating and testing collision probability.
We provide an exact solution to the ideal-gas-like models studied in econophysics to understand the microscopic origin of Pareto-law. In these class of models the key ingredient necessary for having a self-organized scale-free steady-state distribution is the trading or collision rule where agents or particles save a d…
One approach to designing decision making logic for an aircraft collision avoidance system frames the problem as a Markov decision process and optimizes the system using dynamic programming. The resulting collision avoidance strategy can be represented as a numeric table. This methodology has been used in the developme…
No-collision maps improve manifold learning for image data.
problem Lack of geometric feature sensitivity in traditional distance measures.
method Developed no-collision transportation maps and distances.
result No-collision distances provide isometry for translations and dilations.
Reduces necessary conditions for collision avoidance on curved spaces.
problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.
A new metric for uncertainty quantification using class collisions.
problem Fine-grained uncertainty quantification in classification problems.
method Introducing the collision matrix and estimating it from one-hot labeled data.
result The collision matrix uniquely recovers the posterior class probability distribution.
New algorithm for multi-player bandits with collision-dependent rewards.
problem Stochastic multi-player multi-armed bandits with collision-dependent reward distributions.
method Error-Correction Collision Communication (EC3) algorithm.
result EC3 algorithm achieves optimal regret approaching centralized MP-MAB regret.
The paper addresses the Multiplayer Multi-Armed Bandit (MMAB) problem, where decision makers or players collaborate to maximize their cumulative reward. When several players select the same arm, a collision occurs and no reward is collected on this arm. Players involved in a collision are informed about this collis…
Algorithm reduces regret in multi-player bandits with unknown collision rewards.
problem Reducing regret in multi-player multi-armed bandits with unknown collision rewards.
method Proposes an algorithm that combines a modified successive elimination strategy with a communication protocol to estimate suboptimality gaps and coordinate among players.
result Achieves logarithmic regret for the problem when collision reward is unknown.
An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…
A new algorithm reduces regret in multi-player bandits without collision info.
problem Decentralized multi-player multi-armed bandits with no collision info.
method EC-SIC algorithm using optimal error correction coding for reward statistics.
result Regret approaches that of centralized with collision info.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
problem Malicious players colliding with cooperative players to prevent rewards.
method Decentralized and robust algorithm RESYNC for defenders.
result RESYNC algorithm is order-optimal, performing gracefully as the number of collisions increases.
Bayesian deep learning predicts satellite collisions.
problem Space debris poses planetary risk.
method Bayesian deep learning with LSTM networks.
result Predicts conjunction event evolution with uncertainties.
New algorithms tackle adversarial multi-player bandits with forced-collision communication.
problem No-sensing adversarial multi-player multi-armed bandits (MP-MAB) problem.
method Adversary-Adaptive Collision-Communication (A2C2) algorithms, attackability-aware and unaware settings, information-theoretic tools, error-correction coding.
result Asymptotic attackability-dependent sublinear regret achieved, with or without knowing attackability.
New strategy achieves optimal regret without communication or collisions in multi-player bandit.
problem Cooperative multi-player stochastic multi-armed bandit with shared randomness.
method Combination of combinatorial approach to generalize geometric intuition.
result Achieves near-optimal regret for any number of players and arms without collisions.
Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.
problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.
We study multiplayer stochastic multi-armed bandit problems in which the players cannot communicate and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider two feedback models: a model in which the players can observe whether a collision has occurred an…