Imagen de Portada

Variational inference via Gaussian interacting particles in the Bures-Wasserstein geometry

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Borghi, Giacomo, Carrillo, José A.
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control 65C35, 90C26, 49Q22, 60H30, 62F15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Wasserstein convergence rates for stochastic particle approximation of Boltzmann models
por: Borghi, Giacomo, et al.
Publicado: (2025)

Consistency of sample-based stationary points for infinite-dimensional stochastic optimization
por: Milz, Johannes
Publicado: (2023)

Kinetic description and convergence analysis of genetic algorithms for global optimization
por: Borghi, Giacomo, et al.
Publicado: (2023)

Chaos propagation in genetic algorithms: An optimal transport approach
por: Borghi, Giacomo
Publicado: (2026)

Bicausal optimal transport for SDEs with irregular coefficients
por: Hitz, Michaela, et al.
Publicado: (2024)

Criticality measure-based error estimates for infinite dimensional optimization
por: Li, Danlin, et al.
Publicado: (2024)

A particle consensus approach to solving nonconvex-nonconcave min-max problems
por: Borghi, Giacomo, et al.
Publicado: (2024)

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
por: Borghi, Giacomo, et al.
Publicado: (2025)

Large Deviations Principle for Bures-Wasserstein Barycenters
por: Jaffe, Adam Quinn, et al.
Publicado: (2024)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
por: Beddrich, Jonas, et al.
Publicado: (2024)

Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
por: Aarset, Christian
Publicado: (2024)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
por: Starnes, Andrew, et al.
Publicado: (2023)

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
por: Esposito, Flavia, et al.
Publicado: (2025)

On the power of linear programming for K-means clustering
por: De Rosa, Antonio, et al.
Publicado: (2024)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
por: Goldfarb, Donald, et al.
Publicado: (2025)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
por: Marumo, Naoki, et al.
Publicado: (2026)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
por: He, Chuan, et al.
Publicado: (2023)

Controlling a Vlasov-Poisson plasma by a Particle-In-Cell method based on a Monte Carlo framework
por: Bartsch, Jan, et al.
Publicado: (2023)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)

FEM-based A-optimal sensor placement for heat source inversion from final time measurement
por: Aarset, Christian, et al.
Publicado: (2025)

Space-time transport of Brownian exit laws
por: Boudabra, Maher
Publicado: (2026)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
por: Scheinberg, Katya, et al.
Publicado: (2023)

An Inexact Regularized Proximal Newton Method without Line Search
por: Dahl, Simeon vom, et al.
Publicado: (2024)

A particle system approach towards the global well-posedness of master equations for potential mean field games of control
por: Liao, Huafu, et al.
Publicado: (2024)

From Nonsmooth Minima to Smooth Branches via Heat Kernel Regularization
por: Jo, Hyeontae
Publicado: (2026)

An interacting particle consensus method for constrained global optimization
por: Carrillo, José A., et al.
Publicado: (2024)

The ratio-cut polytope and K-means clustering
por: De Rosa, Antonio, et al.
Publicado: (2020)

A Particle Algorithm for Mean-Field Variational Inference
por: Du, Qiang, et al.
Publicado: (2024)

Strong Global Convergence of the Consensus-Based Optimization Algorithm
por: Bonandin, Sabrina, et al.
Publicado: (2025)

A Probabilistic Approach to Trajectory-Based Optimal Experimental Design
por: Attia, Ahmed
Publicado: (2026)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
por: Jin, Ruinan, et al.
Publicado: (2026)

Infinite-dimensional spherical-radial decomposition for probabilistic functions, with application to constrained optimal control and Gaussian process regression
por: Wang, Kewei, et al.
Publicado: (2026)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
por: Yoon, TaeHo, et al.
Publicado: (2026)

Self-interacting CBO: Existence, uniqueness, and long-time convergence
por: Huang, Hui, et al.
Publicado: (2024)

Full Discretization of Stochastic Semilinear Schrödinger equation driven by multiplicative Wiener noise
por: Bhar, Suprio, et al.
Publicado: (2025)

On the Uniqueness of Kantorovich Potentials
por: Staudt, Thomas, et al.
Publicado: (2022)

Mean square error analysis of stochastic gradient and variance-reduced sampling algorithms
por: Lu, Jianfeng, et al.
Publicado: (2025)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
por: Zhu, Daoli, et al.
Publicado: (2023)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
por: Gratton, Serge, et al.
Publicado: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
por: Gratton, S., et al.
Publicado: (2022)