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

Trend · papers per month

82164246328 · Jun 202019922001200920172026
48 results for point particles

This work finds mixed equilibria in zero-sum games using interacting particle dynamics.

problem Finding mixed equilibrium points in continuous minmax games.
method A method based on entropic regularisation of two-layer zero-sum games with interacting particle dynamics.
result The sequence of empirical measures of the particle system satisfies a large deviation principle as the number of particles grows to infinity, implying convergence of the empirical measure and the Nikaidô-Isoda error.

A new model for generating point processes with complex geometries.

problem Difficulties in modeling point processes with large numbers of particles and complex geometries.
method Gradient descent algorithm applied to a phase harmonic operator on wavelet transforms of point patterns.
result The model allows for fast sampling of new configurations that match the statistics of observed point processes.

We proposed a novel graph convolutional neural network that could construct a coarse, sparse latent point cloud from a dense, raw point cloud. With a novel non-isotropic convolution operation defined on irregular geometries, the model then can reconstruct the original point cloud from this latent cloud with fine detail…

2019-10-07abs ↗pdf ↗

A new method solves high-dimensional MFGs using particle-based flow matching.

problem Solving high-dimensional Mean-Field Games (MFGs) is computationally challenging.
method Proposes a particle-based deep Flow Matching (FM) method to update particles and train a flow neural network.
result Proves convergence of the scheme to a stationary point sublinearly and linearly under convexity assumptions.

Estimates log-likelihood of interacting particle systems using virtual particles.

problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.

A method makes particle filters differentiable without altering their forward pass.

problem Compatibility issues between particle filters and automatic differentiation.
method Introduces a correction to particle weights using the stop-gradient operator.
result Automatic differentiation produces good estimators for gradients and second-order derivatives.

We develop a gluing construction which adds scaled and truncated asymptotically Euclidean solutions of the Einstein constraint equations to compact solutions with potentially non-trivial cosmological constants. The result is a one-parameter family of initial data which has ordinary and scaled "point-particle" limits an…

2009-08-12abs ↗pdf ↗

New particle algorithms optimize latent variable models.

problem Optimizing latent variable models for maximum likelihood estimation.
method Identify gradient flows associated with free energy functional and discretize them to create particle-based algorithms.
result Novel particle algorithms scale to high-dimensional settings and perform well in experiments.

We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining stochastic approximation EM and particle Gibbs with ancestor sampling (PGAS), PS…

2018-06-25abs ↗pdf ↗

We consider quasifuchsian manifolds with "particles", i.e., cone singularities of fixed angle less than ππ going from one connected component of the boundary at infinity to the other. Each connected component of the boundary at infinity is then endowed with a conformal structure marked by the endpoints of the particle…

2009-09-23abs ↗pdf ↗

New method for online learning in interacting particle systems.

problem Parameter estimation in stochastic interacting particle systems.
method Stochastic approximation of gradient of asymptotic log likelihood using continuous observations.
result Convergence to stationary points of asymptotic log-likelihood under suitable assumptions.

GER learns particle dynamics from unpaired snapshots using physics-informed GANs.

problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.

Generative algorithms learn high-dimensional data efficiently and generate new samples.

problem Learning from scarce high-dimensional data.
method Lipschitz-regularized gradient flows and particle-based algorithms.
result Correctly transports gene expression data points with high dimensionality.

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…

2018-10-11abs ↗pdf ↗

EggNet reconstructs particle tracks from hits using evolving graph attention networks.

problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.

We consider the motion of a classical colored spinless particle under the influence of an external Yang-Mills potential AA on a compact manifold with boundary of dimension 3\geq 3. We show that under suitable convexity assumptions, we can recover the potential AA, up to gauge transformations, from the lens data of t…

2017-10-05abs ↗pdf ↗

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.

Unified framework for photon and massive particle hypersurfaces in stationary spacetimes.

problem Understanding photon and massive particle hypersurfaces in stationary spacetimes.
method Unified framework using Killing-invariant timelike hypersurfaces and associated Finsler structures.
result Conditions for a hypersurface to be a photon or massive particle hypersurface are established.

New method learns particle system potentials from unlabeled data.

problem Learning potentials of interacting particle systems from unlabeled data with trajectory information missing.
method Introduces a self-test loss function based on stochastic evolution equation.
result Method outperforms baseline methods in robust estimation of large, high-dimensional systems.

The concepts of relative velocity and acceleration, deviation velocity and acceleration and relative momentum of point particles in spaces (manifolds), the tangent bundle of which is equipped with a transport along paths, are introduced. If the tangent bundle is endowed also with a metric, it gives rise also to the not…

2003-10-14abs ↗pdf ↗

This paper tackles hidden state inference for HMMs using particle filtering.

problem Inference for hidden states under HMMs is challenging due to unavailable true labels.
method Adaptive conformal inference framework using particle filtering.
result The framework produces prediction sets with specific aggregated coverage levels.

Bayesian methods are appealing in their flexibility in modeling complex data and ability in capturing uncertainty in parameters. However, when Bayes' rule does not result in tractable closed-form, most approximate inference algorithms lack either scalability or rigorous guarantees. To tackle this challenge, we propose …

2015-06-09abs ↗pdf ↗

Improves forecasting accuracy and uncertainty characterization for spatio-temporal data.

problem Lack of uncertainty characterization in classical and deep learning models for spatio-temporal data.
method Bayesian inference using particle flow for approximating the posterior distribution of hidden states.
result Our approach provides better uncertainty characterization while maintaining comparable accuracy.

We prove two related results. The first is an ``Earthquake Theorem'' for closed hyperbolic surfaces with cone singularities where the total angle is less than ππ: any two such metrics in are connected by a unique left earthquake. The second result is that the space of ``globally hyperbolic'' AdS manifolds with ``parti…

2006-09-04abs ↗pdf ↗

We consider an open domain with a compact boundary in an Euclidean space and a Schroedinger operator with magnetic field on this domain. We give sufficient conditions on the rate of growth of the magnetic field near the boundary which guarantees essential self-adjointness of this operator. From the physical point of vi…

2009-03-04abs ↗pdf ↗

New method for LVEBMs using saddle-point optimization and Langevin updates.

problem Expressive generative modeling of latent variables with hidden structure.
method Reformulate LVEBM training as a saddle problem, using Langevin updates and gradient flows.
result Proves existence and convergence of the algorithm under standard assumptions, with improved ELBO bounds.

We develop the Lorentzian geometry of a crooked halfspace in 2+1-dimensional Minkowski space. We calculate the affine, conformal and isometric automorphism groups of a crooked halfspace, and discuss its stratification into orbit types, giving an explicit slice for the action of the automorphism group. The set of parall…

2012-11-18abs ↗pdf ↗

Recent results at the Large Hadron Collider (LHC) have pointed to enhanced physics capabilities through the improvement of the real-time event processing techniques. Machine learning methods are ubiquitous and have proven to be very powerful in LHC physics, and particle physics as a whole. However, exploration of the u…

2018-04-16abs ↗pdf ↗

The study identifies conjugate and cut points in ideal fluid motion configurations.

problem Understanding stability and re-convergence of fluid configurations.
method Existence and non-existence of conjugate points in specific fluid configurations, using geometric and physical analysis.
result Existence of conjugate points in Kolmogorov flows and non-existence in Arnold steady states.

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.

Jointly estimates flow fields and particle properties from Lagrangian data.

problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.

This paper optimizes functions of probability measures using particle gradient descent for displacement convex functions.

problem Optimizing functions of probability measures with displacement convex properties.
method Particle gradient descent applied to displacement convex functions with theoretical guarantees.
result Finite number of particles and computations are sufficient to find optimal solutions for displacement convex functions.

The excluded area between a pair of two-dimensional hard particles with given relative orientation is the region in which one particle cannot be located due to the presence of the other particle. The magnitude of the excluded area as a function of the relative particle orientation plays a major role in the determinatio…

2019-02-15abs ↗pdf ↗

Inference-Time Scaling can be extended to domains prone to systematic failure using intrinsic statistics.

problem Scaling inference time in domains prone to systematic failure
method Intrinsic Selection (iS), Intrinsic Particle Filtering (iPF), and Particle Distillation (dPF)
result Intrinsic Selection improves engineering design selection by 20% and pass@1 by 6.1 points on average.