Research
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,657 papers · 148 categories

Trend · papers per month

2356 · Dec 201819922001200920172026
48 results for Proton collision

Tensor networks improve anomaly detection at LHC for new physics.

problem Identifying new phenomena in proton collision events at LHC.
method Tensor network-based anomaly detection using Matrix Product State with an isometric feature map.
result Tensor networks outperform established quantum methods in identifying new phenomena.

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.

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.

Machine Learning (ML) is one of the most exciting and dynamic areas of modern research and application. The purpose of this review is to provide an introduction to the core concepts and tools of machine learning in a manner easily understood and intuitive to physicists. The review begins by covering fundamental concept…

2018-03-23abs ↗pdf ↗

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.

Develops a neural surrogate for proton dose calculation using Monte Carlo dropout uncertainty.

problem Computational demand in proton therapy workflows requiring repeated evaluations.
method Integrates Monte Carlo dropout into a neural network surrogate for fast, differentiable dose predictions and uncertainty quantification.
result Shows significant speedups over MC while retaining uncertainty information.

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.

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.

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.

Identifying the flavour of neutral BB mesons production is one of the most important components needed in the study of time-dependent CPCP violation. The harsh environment of the Large Hadron Collider makes it particularly hard to succeed in this task. We present an inclusive flavour-tagging algorithm as an upgrade of…

2017-05-24abs ↗pdf ↗

Recent literature on deep neural networks for tagging of highly energetic jets resulting from top quark decays has focused on image based techniques or multivariate approaches using high-level jet substructure variables. Here, a sequential approach to this task is taken by using an ordered sequence of jet constituents …

2017-04-07abs ↗pdf ↗

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.

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.

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 MM 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…

2019-09-28abs ↗pdf ↗

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…

2017-08-16abs ↗pdf ↗

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 ildeO(T) ilde{O}(\sqrt{T}) 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…

2018-08-25abs ↗pdf ↗

The Kepler-Heisenberg problem is that of determining the motion of a planet around a sun in the Heisenberg group, thought of as a three-dimensional sub-Riemannian manifold. The sub-Riemannian Hamiltonian provides the kinetic energy, and the gravitational potential is given by the fundamental solution to the sub-Laplaci…

2019-12-28abs ↗pdf ↗

New algorithm for multi-player bandits without needing lower bounds or scaling inversely.

problem Multi-player bandits without collision sensing information.
method Proposes a novel algorithm that circumvents two problems of existing algorithms.
result Proves a theoretical regret upper bound and shows superior performance in practice.

This work examines the role of reinforcement learning in reducing the severity of on-road collisions by controlling velocity and steering in situations in which contact is imminent. We construct a model, given camera images as input, that is capable of learning and predicting the dynamics of obstacles, cars and pedestr…

2019-01-03abs ↗pdf ↗

Up to symmetries, the orbits of three equal masses under an inverse cube force with zero angular momentum and constant moment of inertia can be reparametrized as the geodesics of a complete, negatively curved metric on a pair of pants. The ends of the pants represent binary collisions. Here we will examine the visibili…

2019-08-28abs ↗pdf ↗