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

66133199265 · Jun 202019922001200920172026
48 results for test particles

The paper studies how test particles' mass and charge vary in Kaluza-Klein models.

problem Understanding how test particles' mass and charge change in Kaluza-Klein models.
method Analyzes geodesic motion in a 5D Kaluza-Klein spacetime with background metrics encoding 4D gauge fields and Higgs-like scalars.
result The mass and charge of test particles become variable when traversing regions with massive gauge fields or non-constant Higgs scalars.

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.

Study evaluates two-sample tests for validating generative models in high dimensions.

problem Validating the performance and efficiency of non-parametric two-sample tests for high-dimensional generative models.
method Proposes and evaluates the sliced Wasserstein distance, mean of Kolmogorov-Smirnov statistics, and novel sliced Kolmogorov-Smirnov statistic.
result One-dimensional-based tests provide comparable sensitivity to other multivariate metrics but with lower computational cost.

We discuss some aspects about the computation of kinematic, spectroscopic, Fermi and astrometric relative velocities that are geometrically defined in general relativity. Mainly, we state that kinematic and spectroscopic relative velocities only depend on the 4-velocities of the observer and the test particle, unlike F…

2011-09-01abs ↗pdf ↗

We report a statistical analysis of the Island ECN (NASDAQ) order book. We determine the static and dynamic properties of this system, and then analyze them from a physicist's viewpoint using an equivalent particle system obtained by treating orders as massive particles and price as position. We identify the fundamenta…

2001-06-06abs ↗pdf ↗

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 ↗

Unified approach unites GANs and diffusion models using particle methods.

problem Combining GANs and diffusion models for generative tasks.
method Proposes a unified framework where generator training is seen as a generalization of particle models.
result Demonstrates that GANs and diffusion models can be integrated within a unified framework.

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…

2017-07-26abs ↗pdf ↗

Sliced kernelized Stein discrepancy improves goodness-of-fit tests and model learning in high dimensions.

problem The curse-of-dimensionality in kernelized Stein discrepancy (KSD).
method Sliced Stein discrepancy and its scalable variants using optimal one-dimensional projections.
result Significantly outperforms KSD and baselines in goodness-of-fit tests and improves model learning.

Study compares MCMC and nested sampling for high-dimensional physics problems.

problem Efficiently sampling high-dimensional Bayesian posterior distributions in particle physics and cosmology.
method Review and comparison of MCMC and nested sampling techniques on high-dimensional test functions and real physics examples.
result Modern MCMC algorithms can outperform nested sampling in certain cases, highlighting implementation details.

An example of mechanical system whose configuration space is direct product of a curved space and the local group of rotations, is presented. The system is considered as a model of spinning particle moving in the space. The Hamiltonian formalism for this system and possible method for its quantization are discussed. It…

1997-03-14abs ↗pdf ↗

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

We discuss some aspects of the differential geometry of curves in Minkowski space. We establish the Serret-Frenet equations in Minkowski space and use them to give a very simple proof of the fundamental theorem of curves in Minkowski space. We also state and prove two other theorems which represent Minkowskian versions…

2005-12-31abs ↗pdf ↗

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

SMI uses mixture models to improve SVGD's performance in Bayesian inference.

problem Variance collapse in SVGD for Bayesian inference, especially with small models.
method Generalizes SVGD to Stein mixture models, optimizing an ELBO lower bound.
result SMI avoids variance collapse and accurately estimates uncertainty for small BNNs.

We address the problem of combining sequence models of symbolic music with user defined constraints. For typical models this is non-trivial as only the conditional distribution of each symbol given the earlier symbols is available, while the constraints correspond to arbitrary times. Previously this has been addressed …

2019-09-10abs ↗pdf ↗

Study infers interaction kernels from multiple particle trajectories.

problem Inferring interaction kernels from multiple particle trajectories in stochastic systems.
method Nonparametric inference approach based on regularized maximum likelihood estimator.
result Consistent estimator with near-optimal learning rate independent of state space dimension.

Here we present a machine learning framework and model implementation that can learn to simulate a wide variety of challenging physical domains, involving fluids, rigid solids, and deformable materials interacting with one another. Our framework---which we term "Graph Network-based Simulators" (GNS)---represents the st…

2020-02-21abs ↗pdf ↗

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.

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.

Bayesian methods and their implementations by means of sophisticated Monte Carlo techniques have become very popular in signal processing over the last years. Importance Sampling (IS) is a well-known Monte Carlo technique that approximates integrals involving a posterior distribution by means of weighted samples. In th…

2017-04-10abs ↗pdf ↗

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 ↗

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

Optimal weights improve particle-based approximations of discrete distributions.

problem Improving particle-based approximations of discrete distributions.
method Proving optimality of weights and showing how to compute them efficiently.
result Optimal weights can be computed from existing particle-based methods without extra costs.

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…

2014-08-29abs ↗pdf ↗

URGE improves diffusion model quality without gradients or Hessian.

problem Improving sample quality in diffusion models without gradient evaluations.
method Path-wise importance reweighting via Girsanov change of measure.
result URGE achieves better generation quality than existing methods.

Improved particle approximation for mean-field neural networks.

problem Particle approximation error for mean-field neural networks.
method Improved particle approximation error by leveraging the problem structure in risk minimization.
result Established an LSI-constant-free particle approximation error concerning the objective gap.

A new particle filter avoids resampling to improve state estimation in high dimensions.

problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.

We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm i…

2014-07-10abs ↗pdf ↗

Paper uses averaging from many particle filters to approximate posterior predictive distributions.

problem Approximating posterior predictive distributions efficiently and accurately.
method Particle swarm filter algorithm that averages many particle filter approximations.
result Law of large numbers and central limit theorem support the method's effectiveness.

This paper studies when particle filtering is efficient for planning in partially observed systems.

problem The efficiency of particle filtering for planning in partially observed linear dynamical systems.
method Coupling of ideal and approximate sequences to bound particle complexity.
result Polynomially many particles suffice for stable systems to approximate optimal planning.