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.
Study particle system with drift dependent on boundary absorption rate.
problem Non-linear diffusion equation with boundary absorption.
method Heat potentials and Volterra integral equations.
result Approximation and numerical solution algorithm for small interaction parameter.
Study new spectral invariants for Laplace and Dirac operators on manifolds.
problem Understanding spectral invariants of elliptic operators on manifolds.
method Introduced new spectral invariants depending on eigenvalues and eigensections, computed asymptotic expansion.
result Computed first two coefficients of the asymptotic expansion of the new spectral invariant.
New method improves nonlinear filtering accuracy with reduced computation.
problem Complex nonlinear filtering with small system noise.
method Asymptotic expansion with ordinary differential equations and Edgeworth-type correction.
result Significantly lower computational cost with improved accuracy.
This work connects point particles to spin chains using geometric methods.
problem Understanding dynamics of free point particles on Riemannian manifolds.
method Kirillov orbit method, geometric quantization, Lagrangian submanifolds.
result Establishes a spectral equivalence between Laplace-Beltrami operator and a spin Hamiltonian.
We discretize a cost functional for image registration problems by deriving Taylor expansions for the matching term. Minima of the discretized cost functionals can be computed with no spatial discretization error, and the optimal solutions are equivalent to minimal energy curves in the space of k-jets. We show that t…
ARM algorithm improves normalizing constant estimation efficiency.
problem Estimating normalizing constants in probabilistic models.
method Adaptive Resample-Move algorithm with optimal particle expansion.
result ARM reduces variance and computational resources compared to fixed particle methods.
Novel method uses Gaussian process to estimate particle sizes from scattering data.
problem Estimating particle size distributions from noisy optical scattering measurements.
method Constrained Gaussian process regression with normalization constraints.
result Accurately reconstructs particle size distributions from noisy data.
In this paper, we propose an efficient Monte Carlo implementation of non-linear FBSDEs as a system of interacting particles inspired by the ideas of branching diffusion method. It will be particularly useful to investigate large and complex systems, and hence it is a good complement of our previous work presenting an a…
Langmuir-Blodgett films (LB-films) consist from few LB-monolayers which are high structured nanomaterials that are very promising materials for applications. We use a geometrical approach to describe structurization into LB-monolayers. Consequently, we develop on the 1-jet space J^1([0,\infty),R^2) the single-time Lagr…
In a flat space, the global topology of comoving space can induce a weak acceleration effect similar to dark energy. Does a similar effect occur in the case of the Poincare dodecahedral space S^3/I^*? Does the effect distinguish the Poincare space from other well-proportioned spaces? The residual acceleration effect in…
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.
Study examines the excluded area between two-dimensional hard particles, identifying key factors affecting its magnitude.
problem Determining the excluded area between two-dimensional hard particles with various orientations and shapes.
method Used principal component analysis and Monte Carlo simulations to analyze randomly generated non-self-intersecting polygons and star lines.
result The minimum excluded area is achieved when particles are antiparallel, and elongation of the particle shape significantly affects the excluded area.
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.
We generalize the notion of a Magnus expansion of a free group in order to extend each of the Johnson homomorphisms defined on a decreasing filtration of the Torelli group for a surface with one boundary component to the whole of the automorphism group of a free group Aut(Fn). The extended ones are …
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.
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.
New sampling method improves on particle-optimization techniques.
problem Particles tend to collapse in SVGD, leading to poor sampling.
method Introduce stochastic noise to update particles, developing non-asymptotic convergence theory.
result More particles do not always improve approximation due to computational constraints.
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…
Topaz uses neural networks to pick particles from cryoEM images efficiently.
problem Manual particle picking is time-consuming and requires post-processing.
method Positive-Unlabeled (PU) learning with minimal labeled data.
result Topaz improves cryoEM reconstruction resolution by up to 0.15 Å.
HIP-NN models molecular energies using a deep neural network with hierarchical terms.
problem Accurately predicting molecular energies from quantum calculations.
method HIP-NN decomposes molecular properties into a sum of hierarchical terms generated by a neural network.
result Achieves state-of-the-art performance with 0.26 kcal/mol mean absolute error.
Optimizes particle filtering for non-stationary environments.
problem Tracking and adapting to non-stationary environments in online prediction.
method Formulated an efficient particle filtering method using online mirror descent algorithm.
result Achieves optimal particle efficiency in non-stationary environments.
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.
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…
Improved particle filters enhance vehicle tracking accuracy.
problem Particle filters struggle with frequent, informative observations.
method Proposes particle filters that sample around recent observations.
result Significant improvement in accuracy and efficiency.
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.
Paper learns particle dynamics for versatile object manipulation.
problem Challenges in traditional rigid-body physics engines for complex scenes.
method Combines learning with particle-based systems for versatile object manipulation.
result Robots achieve complex manipulation tasks using the learned simulator.
Bayesian inference using particle flow and neural operators.
problem Efficiently updating beliefs with new data.
method ODE-based neural operator for particle flow, meta-learning for generalization.
result Generalization across different priors, observations, and sequential inference.
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.
New string singularities enable quantum teleportation of massive particles.
problem Quantum teleportation of massive particles at large distances.
method Introduction of new world-sheet string singularities (cusps) that are stable and allow for the emission of captured massive quantum particles.
result Existence of a new mechanism for quantum teleportation of massive particles.
New particle filter estimates model evidence without bias.
problem Unbiased estimation of marginal likelihood for model comparison.
method Particle filter with rejection control.
result Unbiased estimation of marginal likelihood.
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.
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…
Deep Sets improve jet discrimination in particle physics.
problem Representing and learning from collider events with variable-length particle sets.
method Energy Flow Networks and Particle Flow Networks, based on Deep Sets framework.
result Improved or similar performance in discriminating quark jets from gluon jets compared to existing methods.
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.
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.
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.