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.
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…
Differentiable resampling improves particle filter performance.
problem Non-differentiability of traditional resampling in particle filters.
method Introduced a neural network resampler (particle transformer) trained with a likelihood-based loss function.
result Learned resampling outperforms traditional methods on synthetic and real-world tasks.
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…
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…
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.
Cryo-electron microscopy (cryoEM) is an increasingly popular method for protein structure determination. However, identifying a sufficient number of particles for analysis (often >100,000) can take months of manual effort. Current computational approaches are limited by high false positive rates and require significant…
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.
Interacting particle methods are increasingly used to sample from complex and high-dimensional distributions. These stochastic particle integration techniques can be interpreted as an universal acceptance-rejection sequential particle sampler equipped with adaptive and interacting recycling mechanisms. Practically, the…
Cryo-electron microscopy (cryo-EM) is an emerging experimental method to characterize the structure of large biomolecular assemblies. Single particle cryo-EM records 2D images (so-called micrographs) of projections of the three-dimensional particle, which need to be processed to obtain the three-dimensional reconstruct…
New algorithm trains latent diffusion models using interacting particles.
problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.
Particle-optimization-based sampling (POS) is a recently developed effective sampling technique that interactively updates a set of particles. A representative algorithm is the Stein variational gradient descent (SVGD). We prove, under certain conditions, SVGD experiences a theoretical pitfall, {\it i.e.}, particles te…
Framework expands particle filtering to estimate states beyond prior boundaries.
problem Limitations of traditional particle filtering in estimating states outside prior support.
method Diffusion-Enhanced Particle Filtering Framework with adaptive diffusion, entropy-driven regularisation, and kernel-based perturbations.
result Framework significantly improves state estimation accuracy and success rates for out-of-boundary targets.
Enhances particle filters with neural augmentation for multi-sub-state tracking.
problem Particle filters struggle with complex or approximated models and low latency requirements.
method Learning Flock (LF) uses a neural network to correct particle weights based on sub-particle relationships.
result LF improves performance, robustness, and latency in radar multi-target tracking.
CMS uses machine learning to improve particle flow reconstruction.
problem Improving particle flow reconstruction in CMS.
method Machine learning, graph neural network, heterogeneous computing.
result Machine-learned PF model outperforms standard algorithm.
A new particle algorithm improves mean-field variational inference.
problem Efficiently approximating nonparametric posterior distributions in machine learning.
method Introduces PArticle VI (PAVI), a novel particle-based algorithm for nonparametric mean-field approximation.
result Obtains non-asymptotic error bounds for PArticle VI, providing the first end-to-end guarantee for particle-based MFVI.
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.
Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such a framework. We formulate an efficient particle filtering methods for the non-st…
Cryo-electron microscopy (cryo-EM) studies using single particle reconstruction are extensively used to reveal structural information on macromolecular complexes. Aiming at the highest achievable resolution, state of the art electron microscopes automatically acquire thousands of high-quality micrographs. Particles are…
We introduce a novel description of the dynamics of the order book of financial markets as that of an effective colloidal Brownian particle embedded in fluid particles. The analysis of a comprehensive market data enables us to identify all motions of the fluid particles. Correlations between the motions of the Brownian…
Achieved all-orders worldline action for Kerr black hole.
problem Calculating effective action for Kerr black hole.
method Twistor particle theory.
result All-orders worldline effective action for Kerr black hole.
dSMC improves parallel processing of state-space models.
problem Processing multiple observations efficiently in state-space models.
method A parallel-in-time particle smoother that reduces complexity to log(T).
result dSMC achieves O(log(T)) time complexity on parallel architectures.
Real-life control tasks involve matters of various substances---rigid or soft bodies, liquid, gas---each with distinct physical behaviors. This poses challenges to traditional rigid-body physics engines. Particle-based simulators have been developed to model the dynamics of these complex scenes; however, relying on app…
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.
Two SVGD variants achieve fast convergence with provable guarantees.
problem Understanding and improving SVGD's performance with finite particles.
method Introducing virtual particles and novel stochastic approximations.
result Provable fast convergence rates for finite-particle SVGD variants.
Paper compares semi-supervised training for differentiable particle filters.
problem Lack of labelled data in real-world applications.
method Compares two semi-supervised training objectives.
result Improved performance in environments with scarce labelled data.
Paper formulates particle flow using variational inference and Fisher-Rao gradient flow.
problem Estimating posterior densities in probabilistic models.
method Variational formulation of particle flow, Fisher-Rao gradient flow, Gaussian and Gaussian mixture approximations.
result Gaussian and Gaussian mixture approximations of Fisher-Rao particle flow reduce to Exact Daum and Huang particle flow under linear Gaussian assumptions.
A new stochastic algorithm approximates optimal distributions without requiring propagation of chaos.
problem Optimizing functionals over probability distributions using finite particle systems.
method Virtual particle stochastic approximation, viewed as a form of stochastic gradient descent in the Wasserstein space.
result The algorithm's output converges to the optimal distribution and produces i.i.d. samples.
New method accelerates energetic variational inference using particle dynamics.
problem Efficiently solving variational inference problems with reduced computational cost.
method Particle-based variational inference with implicit scheme, inspired by energy quadratization and operator splitting.
result Significantly reduces computational cost compared to existing methods.
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.
The ability to track a moving vehicle is of crucial importance in numerous applications. The task has often been approached by the importance sampling technique of particle filters due to its ability to model non-linear and non-Gaussian dynamics, of which a vehicle travelling on a road network is a good example. Partic…
Particle-based variational inference offers a flexible way of approximating complex posterior distributions with a set of particles. In this paper we introduce a new particle-based variational inference method based on the theory of semi-discrete optimal transport. Instead of minimizing the KL divergence between the po…
The present paper describes a practical example in which the probability distribution of the prices of a stock market blue chip is calculated as the wave function of a quantum particle confined in a potential well. This model may naturally explain the operation of several empirical rules used by technical analysts. Mod…
Hybrid approach combines transformer and Bayesian filtering for robust multiple particle tracking.
problem Challenges in tracking multiple particles in noisy scenes due to combinatorial explosion of hypotheses.
method Attention-Bayesian hybrid framework using transformer for association and Bayesian filtering for pruning hypotheses.
result Improved tracking accuracy and robustness against spurious detections.
Study on convergence of Langevin dynamics for zero-sum games in probability distributions.
problem Analyzing convergence of Langevin dynamics for zero-sum games in probability distributions.
method Proved exponential and biased convergence guarantees for mean-field and finite-particle min-max Langevin dynamics.
result Explicit iteration complexity for finite-particle algorithms to approximate equilibrium distributions.
CPS solves inverse problems using forward passes and constrained particle seeking.
problem Solving inverse problems with limited forward observation information.
method Gradient-free approach that reformulates inverse problem as constrained optimization.
result CPS achieves results comparable to gradient-based methods while outperforming alternatives.
Particle Markov chain Monte Carlo techniques rank among current state-of-the-art methods for probabilistic program inference. A drawback of these techniques is that they rely on importance resampling, which results in degenerate particle trajectories and a low effective sample size for variables sampled early in a prog…
In this article, we present the elitist particle filter based on evolutionary strategies (EPFES) as an efficient approach for nonlinear system identification. The EPFES is derived from the frequently-employed state-space model, where the relevant information of the nonlinear system is captured by an unknown state vecto…
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.
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…
New method learns latent energy models using particle algorithms.
problem Learning latent variable models with energy priors.
method Continuous-time SDEs for MMLE, particle-based discretization.
result Practical algorithm converges to solve MMLE problem.