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.
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 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.
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.
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.
This work develops a particle system to approximate Fisher-Rao gradient flows in mean-field optimization.
problem Optimizing probability measures in neural network contexts.
method Constructing an interacting particle system approximating Fisher-Rao gradient flows.
result Propagation of chaos for the Fisher-Rao gradient flow in entropic mean-field optimization.
New particle-based VI algorithm expands function class and improves scalability.
problem Limited function class in particle-based VI algorithms restricts flexibility and scalability.
method Introduces a functional regularization term to expand the function class and proposes PFG algorithm.
result Proposed PFG algorithm has larger function class, improved scalability, better adaptation to ill-conditioned distributions, and provable convergence.
We present a particle flow realization of Bayes' rule, where an ODE-based neural operator is used to transport particles from a prior to its posterior after a new observation. We prove that such an ODE operator exists. Its neural parameterization can be trained in a meta-learning framework, allowing this operator to re…
New method optimizes multiple objectives using particle dynamics and gradient flow.
problem Optimizing multiple conflicting objectives in complex scenarios.
method Interacting particle method combining Langevin and birth-death dynamics with a dominance potential.
result Method effectively relocates dominated particles, improving Pareto optimality.
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.
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.
Graph Neural Networks model 3D granular flow simulations.
problem Accurate modeling of complex 3D granular flow processes.
method Graph Neural Networks approach to simulate 3D granular flow using LIGGGHTS.
result Machine learning trajectories match physical granular flow processes.
New gradient flows improve high-dimensional sampling.
problem Sampling from high-dimensional target densities.
method Introducing Radon--Wasserstein gradient flows.
result Linear scaling in particles and dimensions.
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.
SIFG uses noisy particles to efficiently sample from complex distributions.
problem Efficient sampling from complex distributions using particle-based methods.
method SIFG introduces a semi-implicit functional gradient flow with Gaussian noise to improve sampling efficiency and accuracy.
result SIFG achieves strong theoretical convergence guarantees and efficient sampling.
A new ParVI framework improves particle-based variational inference methods.
problem Non-trivial kernel design in particle-based variational inference methods.
method Proposes a generalized Wasserstein gradient descent (GWG) framework with broader regularizers.
result Demonstrates strong convergence guarantees and effectiveness on simulated and real data.
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.
Improved particle-flow event reconstruction for future colliders using scalable neural networks.
problem Efficient and accurate particle reconstruction in future particle detectors.
method Comparative study of scalable machine learning models (graph neural network and kernel-based transformer) for event reconstruction.
result Graph neural network model improves jet transverse momentum resolution by up to 50%.
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…
A new algorithm computes Wasserstein barycenters without entropic regularization.
problem Computing Wasserstein barycenters efficiently and accurately.
method Free-support algorithm based on particle flow and Riemannian geometry.
result The algorithm avoids entropic regularization and is computationally tractable.
BGNNs model particle-boundary interactions efficiently.
problem Efficiently modeling geometric boundaries in 3D simulations.
method Introduce Boundary Graph Neural Networks (BGNNs) to dynamically modify graph structures.
result BGNNs accurately reproduce 3D granular flows without handcrafted conditions.
Gaussian Process Hydrodynamics approximates fluid flow equations using probabilistic kernels.
problem Approximating fluid flow equations with fewer particles and uncertainty estimates.
method Lagrangian particle-based approach with Gaussian Process (GP) prior and physics-informed kernels.
result GPH requires fewer particles and provides uncertainty estimates.
MonoFlow rethinks GANs using Wasserstein gradient flows.
problem Inconsistencies between GAN theory and practice.
method Unified generative modeling framework based on Wasserstein gradient flows.
result Adversarial training can be seen as particle flow optimization.
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.
New algorithm improves clustering and quantization using MMD.
problem Approximating probability distributions with weighted mixtures of Dirac measures.
method Gradient flow, mean shift, and MMD-optimal quantization.
result MSIP algorithm is more robust than state-of-the-art methods.
We develop a stochastic target representation for Ricci flow and normalized Ricci flow on smooth, compact surfaces, analogous to Soner and Touzi's representation of mean curvature flow. We prove a verification/uniqueness theorem, and then consider geometric consequences of this stochastic representation. Based on this …
The paper analyzes rates for a modified gradient descent method using Stein variational gradients.
problem Improving the accuracy of gradient descent methods for complex target distributions.
method Derives finite-particle rates for regularized Stein variational gradient descent (R-SVGD).
result Establishes explicit non-asymptotic bounds for time-averaged empirical measures.
Physics-guided reinforcement learning optimizes swimming in turbulent flows.
problem Optimizing swimming efforts to maintain proximity in turbulent environments.
method Physics-informed actor-physicist reinforcement learning algorithm.
result Physics-informed reinforcement learning outperforms standard methods in turbulent flow control.
Hamilton flows on Kähler manifold for which all trajectories are H-planar curves (complex analog of geodesics) are considered. These flows are called H-planar. The equation which has to obey the Hamiltonian of H-planar Hamilton flow is received and the method of finding general solution of this equation is propos…
New method estimates velocity fields for minimizing f-divergences without overfitting.
problem Minimizing statistical discrepancies between target and particle distributions.
method Directly estimate velocity fields using interpolation techniques, proving consistency under mild conditions.
result Consistent estimators of velocity fields improve accuracy in applications like domain adaptation and missing data imputation.
Bayesian inference for expensive likelihoods using Langevin Monte Carlo with NF.
problem Sampling from complex posterior distributions with expensive likelihoods.
method Deterministic Langevin equation with NF gradient, Metropolis-Hastings updates.
result Competitive performance compared to state-of-the-art methods.
ASVGD accelerates SVGD for efficient sampling from Gaussian targets.
problem Efficient sampling from Gaussian distributions using SVGD.
method Accelerated gradient flow in a metric space of probability densities, including momentum and Wasserstein regularization.
result ASVGD achieves optimal convergence rate for Gaussian targets, independent of covariance.
MFGs explain and enhance generative models, revealing new model types.
problem Understanding and improving generative models.
method Mean-field games (MFGs) as a framework to explain and enhance generative models.
result Established connections between MFGs and generative flows, diffusions, and gradient flows.
ASVGD accelerates SVGD for efficient sampling.
problem Slow SVGD in high-dimensional sampling.
method Accelerated gradient flow in a metric space of probability densities, using Nesterov's method and momentum-based updates.
result ASVGD outperforms SVGD and other methods in sampling efficiency.
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.
REGS samples from unnormalized distributions using gradient flow and neural networks.
problem Sampling from unnormalized distributions with high accuracy and efficiency.
method REGS is a particle method that iteratively transforms samples from a reference distribution to match an unnormalized target distribution using Wasserstein gradient flow and neural networks.
result REGS outperforms state-of-the-art methods in sampling from challenging multimodal distributions and real datasets.
PVI improves SIVI by directly optimizing ELBO without parametric assumptions.
problem Intractable variational densities in SIVI methods.
method Particle Variational Inference (PVI) using empirical measures to approximate optimal mixing distributions.
result PVI directly optimizes the ELBO and performs favorably compared to other SIVI methods.
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.
SPH-ParVI uses fluid dynamics to sample unknown densities efficiently.
problem Sampling partially known densities or using gradients in probabilistic models.
method Smoothed Particle Hydrodynamics (SPH) for modeling fluid dynamics to approximate target densities.
result SPH-ParVI provides fast, flexible, scalable, and deterministic sampling for Bayesian inference and generative models.
We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data is available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze t…
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.
Many tasks in machine learning and signal processing can be solved by minimizing a convex function of a measure. This includes sparse spikes deconvolution or training a neural network with a single hidden layer. For these problems, we study a simple minimization method: the unknown measure is discretized into a mixture…
We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method, based on principles used in graph coloring and spectral graph drawing algorithms, examines a measur…
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.
Gradient flows on graphons converge to curves on graphon space.
problem Optimizing functions on large, exchangeable graphs.
method Euclidean gradient flow on edge weights converges to a curve on graphon space.
result Gradient flows on graphons can be described as curves of maximal slope on graphon space.
New method for constrained sampling using gradient flows.
problem Sampling from constrained domains.
method Introducing a boundary condition for gradient flow to confine particles within the domain.
result Provable continuous-time convergence in total variation for constrained sampling.
KSD Descent uses KSD to sample from a target distribution efficiently.
problem Sampling from complex target distributions efficiently.
method Wasserstein gradient flow of KSD, using L-BFGS optimization.
result KSD Descent can sample from a target distribution using a set of particles.
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.