惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

D
DataBreaches.Net
有赞技术团队
有赞技术团队
Jina AI
Jina AI
H
Help Net Security
D
Docker
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Blog — PlanetScale
Blog — PlanetScale
Hugging Face - Blog
Hugging Face - Blog
罗磊的独立博客
MyScale Blog
MyScale Blog
N
Netflix TechBlog - Medium
B
Blog RSS Feed
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
T
The Blog of Author Tim Ferriss
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
MongoDB | Blog
MongoDB | Blog
美团技术团队
M
MIT News - Artificial intelligence
阮一峰的网络日志
阮一峰的网络日志
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
IT之家
IT之家

stat updates on arXiv.org

A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint Robust and Fast Training via Per-Sample Clipping
Adapted Wasserstein Barycenters of Gaussian Processes
[Submitted on 24 Apr 2026 (v1), last revised 16 Jul 2026 (this v · 2026-04-24 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study barycenters of filtered Gaussian processes in adapted Wasserstein space. The adapted Wasserstein distance refines classical optimal transport by requiring transport plans to respect the temporal flow of information, making it the natural metric for stochastic systems with filtration constraints, as in stochastic control, mathematical finance, and sequential decision problems. We prove that the \emph{unrestricted} barycenter problem for weighted Fréchet means of filtered Gaussian inputs admits a solution with Gaussian underlying law, representable as an enlarged filtered Gaussian process but not necessarily as an ordinary one. The problem decomposes into finitely many classical Bures--Wasserstein barycenter problems for the covariance contributions of the successive innovations.
We then treat the \emph{restricted} problem, in which the barycenter is required to be an ordinary filtered Gaussian process, giving a rank and common-noise criterion for when the two problems agree, sufficient conditions for uniqueness, and first order optimality and regularity results. Under a martingale constraint we obtain an explicit solution via martingale projection and Bures--Wasserstein barycenters of the Gaussian increments. Beyond their intrinsic theoretical interest, our results provide a principled way to build representative models from collections of Gaussian stochastic systems, with applications to stochastic optimization, robust finance, and sequential statistical analysis.

Submission history

From: Francesco Mattesini [view email]
[v1] Fri, 24 Apr 2026 11:14:42 UTC (286 KB)
[v2] Thu, 16 Jul 2026 15:12:43 UTC (328 KB)