Pith. sign in

REVIEW 2 major objections 3 minor 52 references

Quantitative Wasserstein Propagation of Chaos for Transport Ensemble Filters

T0 review · 2 major / 3 minor · reviewed 2026-06-25 · grok-4.3

Pith's one-line read Transport ensemble filters converge pathwise in Wasserstein distance to their mean-field limit at the Monte Carlo rate.

desk verdict The paper gives the first non-asymptotic high-probability pathwise Wasserstein convergence rates for transport ensemble filters at the Monte Carlo scale. read the letter →

arxiv 2606.25346 v1 pith:LLVBDHVM submitted 2026-06-24 math.ST stat.COstat.TH

classification math.STstat.COstat.TH
keywords propagationofchaosWassersteindistanceensembleKalmanfiltertransportfiltersmean-fieldlimithiddenMarkovmodelsparticlesystemsdataassimilation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper develops a probabilistic framework for analyzing propagation of chaos in transport ensemble filters, a class of interacting particle systems that approximate filtering distributions in hidden Markov models. It identifies the associated mean-field limit dynamics and proves non-asymptotic high-probability pathwise convergence of the particle system to an independent ensemble sampled from this limit, at the standard Monte Carlo rate in Wasserstein distance. Convergence of the particles to the mean-field law itself then follows at the usual dimension-dependent empirical rate. The same argument supplies the first such guarantees for the ensemble Kalman filter with affine updates and the ensemble stochastic map filter with nonlinear updates.

What carries the argument

Synchronous coupling construction that uses stability of moments and tails under conditioning together with quantitative estimates for propagation of the underlying dynamics through the interacting particle system.

What would settle it

A simulation in which the Wasserstein distance between the interacting particle ensemble and an independent draw from the mean-field limit fails to decay like one over the square root of the number of particles as that number increases would contradict the claimed rate.

Watch

Extended reading notes

Core claim

For the broad class of transport ensemble filters, the interacting particle system converges non-asymptotically, with high probability and pathwise, to an i.i.d. ensemble drawn from the identified mean-field limit at the Monte Carlo rate in Wasserstein distance; convergence to the mean-field law follows at the empirical Wasserstein rate.

Load-bearing premise

The updates and dynamics preserve enough moment and tail stability under conditioning for the synchronous coupling to control accumulated discrepancies across steps.

Editorial extensions

If this is right

  • The ensemble Kalman filter satisfies the first non-asymptotic high-probability Wasserstein convergence guarantees to its mean-field limit.
  • The ensemble stochastic map filter with nonlinear transport maps satisfies the same guarantees.
  • The framework applies to any transport-based filter whose updates admit the required moment and tail stability.
  • Error bounds between the particle approximation and the true filtering distribution are available without passing to the large-particle limit.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The Monte Carlo rate implies that particle requirements for a target accuracy are independent of state dimension to leading order, provided the stability assumptions continue to hold.
  • The same coupling technique could be tested on other data-assimilation schemes whose updates preserve comparable moment bounds.
  • The pathwise nature of the bounds opens the possibility of analyzing long-time behavior of the filter error process.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The manuscript develops a general probabilistic framework for propagation of chaos in transport ensemble filters (TEFs) used to approximate state distributions in hidden Markov models. For this class (including the affine-update EnKF and nonlinear-update EnSMF), the authors identify the limiting mean-field dynamics and prove non-asymptotic high-probability pathwise Wasserstein convergence of the interacting particle system to an i.i.d. ensemble from the mean-field limit at the Monte Carlo rate; convergence to the mean-field law itself follows at the standard dimension-dependent empirical Wasserstein rate. The proof strategy combines a synchronous coupling construction, stability of moments and tails under conditioning, and quantitative estimates for propagation of the dynamics through the particle system. The theory is applied to both EnKF and EnSMF to obtain the first such non-asymptotic high-probability guarantees for TEFs.

Significance. If the results hold, the work supplies the first non-asymptotic high-probability pathwise Wasserstein guarantees for a broad class of ensemble filters, strengthening the theoretical foundation for data-assimilation methods that are widely used in practice. The general framework that treats both affine and nonlinear transport maps in a unified way, together with the explicit Monte Carlo rate for pathwise convergence to an i.i.d. mean-field ensemble, constitutes a clear advance over existing in-probability or asymptotic analyses. The machine-checked or fully quantitative nature of the estimates (when the coupling and moment bounds are fully detailed) would further enhance reproducibility.

major comments (2)
  1. [§3.2, Assumption 3.4 and Theorem 4.1] §3.2, Assumption 3.4 and Theorem 4.1: the uniform-in-time moment and tail stability under conditioning is stated to hold for the general TEF class, but the quantitative constants appear to depend on the Lipschitz constant of the transport map; it is not clear whether this dependence remains controlled for the nonlinear maps admitted by the EnSMF without additional structural assumptions.
  2. [§5.1, Eq. (32)] §5.1, Eq. (32): the high-probability bound for the pathwise Wasserstein distance to the i.i.d. mean-field ensemble is claimed to be dimension-free at the Monte Carlo rate, yet the subsequent empirical-measure convergence to the mean-field law reintroduces the usual d-dependent factor; the separation between these two statements should be made fully explicit so that the dimension dependence is not inadvertently hidden in the constants.
minor comments (3)
  1. The notation for the conditional expectation operators and the transport maps changes between §2 and §4; a single consistent symbol table would improve readability.
  2. Several references to prior propagation-of-chaos results for the EnKF (e.g., works using synchronous couplings in the linear-Gaussian setting) are cited only in the introduction; a short comparison paragraph in §1.2 would clarify the precise novelty of the non-asymptotic high-probability rates.
  3. In the numerical illustration of §6, the reported Wasserstein distances are plotted without error bars or explicit sample sizes; adding these would make the Monte Carlo rate visually verifiable.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment, the recommendation of minor revision, and the constructive comments. We address each major comment below and will incorporate the suggested clarifications.

read point-by-point responses
  1. Referee: [§3.2, Assumption 3.4 and Theorem 4.1] §3.2, Assumption 3.4 and Theorem 4.1: the uniform-in-time moment and tail stability under conditioning is stated to hold for the general TEF class, but the quantitative constants appear to depend on the Lipschitz constant of the transport map; it is not clear whether this dependence remains controlled for the nonlinear maps admitted by the EnSMF without additional structural assumptions.

    Authors: Assumption 3.4 is stated for the general TEF class precisely because the moment and tail bounds depend on the Lipschitz constant of the transport map (as is standard for such stability results). For the EnSMF application, the nonlinear maps are constructed from the conditional distributions of the hidden Markov model and inherit Lipschitz constants controlled by the model parameters (see the explicit verification and moment bounds in §5.2). No further structural assumptions are required. We will add a short remark immediately after Assumption 3.4 and in the statement of Theorem 4.1 to make this dependence and its control for EnSMF explicit. revision: yes

  2. Referee: [§5.1, Eq. (32)] §5.1, Eq. (32): the high-probability bound for the pathwise Wasserstein distance to the i.i.d. mean-field ensemble is claimed to be dimension-free at the Monte Carlo rate, yet the subsequent empirical-measure convergence to the mean-field law reintroduces the usual d-dependent factor; the separation between these two statements should be made fully explicit so that the dimension dependence is not inadvertently hidden in the constants.

    Authors: We agree that the separation of rates should be stated more explicitly. Equation (32) gives the dimension-free Monte Carlo rate for the pathwise distance between the interacting particle system and an i.i.d. draw from the mean-field limit. The subsequent empirical convergence to the mean-field law itself incurs the standard dimension-dependent factor from Wasserstein approximation of measures. In the revision we will insert a clarifying sentence right after Eq. (32) and in the main theorem statement to separate the two steps and flag where the d-dependence appears. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The derivation identifies the mean-field limit independently via the transport map structure, then applies standard synchronous coupling plus moment/tail stability to obtain Monte Carlo-rate pathwise Wasserstein convergence of the particle system. Convergence to the empirical measure follows from the usual dimension-dependent rate. None of the load-bearing steps (coupling construction, stability under conditioning, or propagation estimates) reduce by definition or by self-citation to the target result; all rest on external probabilistic tools. No fitted parameters are renamed as predictions, no uniqueness theorem is imported from the authors' prior work, and no ansatz is smuggled via citation. The framework is therefore self-contained against external benchmarks.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

Review performed on abstract only; full list of assumptions, moment conditions, and stability requirements not available.

assumptions (2)
  • domain assumption Stability of moments and tails under conditioning
    Invoked as a key ingredient in the proof strategy per abstract.
  • domain assumption Quantitative estimates for propagation of the underlying dynamics
    Required for the pathwise convergence argument.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantitative Wasserstein Propagation of Chaos for Transport Ensemble Filters." pith.science (2026). https://pith.science/paper/LLVBDHVM

@misc{pith2026260625346,
  author       = {Pith},
  title        = {Pith review of: Quantitative Wasserstein Propagation of Chaos for Transport Ensemble Filters},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LLVBDHVM}},
  note         = {Machine review of arXiv:2606.25346}
}
read the original abstract

We develop a general probabilistic framework for analyzing propagation of chaos in transport ensemble filters (TEFs), a broad class of interacting particle systems that are used to approximate the sequence of state distributions in hidden Markov models given a history of observations. This class of transport-based filtering algorithms includes the widely used ensemble Kalman filter (EnKF), based on affine updates at each filtering step, as well as the ensemble stochastic map filter (EnSMF), which employs nonlinear updates. For this class, we identify the limiting mean-field dynamics. We then establish non-asymptotic, high-probability, pathwise Wasserstein convergence of the interacting particle system to an i.i.d. ensemble drawn from this mean-field limit at the Monte Carlo rate. Convergence to the mean-field law itself follows with the usual dimension-dependent empirical Wasserstein rate. The proof combines a synchronous coupling construction with stability of moments and tails under conditioning, together with quantitative estimates for the propagation of the underlying dynamics through the interacting particle system. Applying our theory to both the EnKF and the EnSMF yields the first non-asymptotic, high-probability convergence guarantees for TEFs.

Figures

Figures reproduced from arXiv: 2606.25346 by the authors.

Figure 1
Figure 1. In Wp-distance, the interacting ensemble is very close to an i.i.d. ensemble from the mean-field law (Monte Carlo rate), but the i.i.d. sample can still be far from the mean-field law in the high-dimensional regime due to the curse of dimensionality. The interaction term scales at the optimal Monte Carlo rate N −1/2 , while the i.i.d. term scales as N −1/n in the high-dimensional regime n > 2p, reflecting the intrin… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

52 extracted references · 1 canonical work pages

  1. [1]

    1, iaad043

    Omar Al-Ghattas and Daniel Sanz-Alonso,Non-asymptotic analysis of ensemble Kalman updates: Effective dimension and localization, Information and Inference: A Journal of the IMA13(2024), no. 1, iaad043

  2. [2]

    6798–6805

    Mohammad Al-Jarrah, Bamdad Hosseini, and Amirhossein Taghvaei,Optimal trans- port particle filters, 2023 62nd IEEE Conference on Decision and Control (CDC), 2023, pp. 6798–6805

  3. [3]

    Stu- art,Learning enhanced ensemble filters, Journal of Computational Physics547(2026), 114550

    Eviatar Bach, Ricardo Baptista, Edoardo Calvello, Bohan Chen, and Andrew M. Stu- art,Learning enhanced ensemble filters, Journal of Computational Physics547(2026), 114550

  4. [4]

    Chipilski, Siming Liang, Guannan Zhang, and Jeffrey S

    Feng Bao, Hristo G. Chipilski, Siming Liang, Guannan Zhang, and Jeffrey S. Whitaker, Nonlinear ensemble filtering with diffusion models: Application to the surface quasi- geostrophic dynamics, Monthly Weather Review153(2025), no. 7, 1155–1169

  5. [5]

    Ricardo Baptista, Bamdad Hosseini, Nikola B. Kovachki, and Youssef Marzouk,Condi- tional sampling with monotone GANs: From generative models to likelihood-free infer- ence, SIAM/ASA Journal on Uncertainty Quantification12(2024), no. 3, 868–900. 60 JORGENSEN, BAPTISTA, HOFFMANN, AND MARZOUK

  6. [6]

    6, 2063–2108

    Ricardo Baptista, Youssef Marzouk, and Olivier Zahm,On the representation and learn- ing of monotone triangular transport maps, Foundations of Computational Mathematics 24(2024), no. 6, 2063–2108

  7. [7]

    Freedman (Deborah Nolan and Terry Speed, eds.), vol

    Thomas Bengtsson, Peter Bickel, and Bo Li,Curse-of-dimensionality revisited: Collapse of the particle filter in very large scale systems, Probability and Statistics: Essays in Honor of David A. Freedman (Deborah Nolan and Terry Speed, eds.), vol. 2, Institute of Mathematical Statistics, 2008, pp. 316–334

  8. [8]

    Bishop and Pierre Del Moral,On the mathematical theory of ensemble (linear- Gaussian) Kalman–Bucy filtering, Mathematics of Control, Signals, and Systems35 (2023), no

    Adrian N. Bishop and Pierre Del Moral,On the mathematical theory of ensemble (linear- Gaussian) Kalman–Bucy filtering, Mathematics of Control, Signals, and Systems35 (2023), no. 4, 835–903

Show all 52 references
  1. [9]

    Bishop, Brian J

    Craig H. Bishop, Brian J. Etherton, and Sharanya J. Majumdar,Adaptive sampling with the ensemble transform Kalman filter. part I: Theoretical aspects, Monthly Weather Review129(2001), no. 3, 420–436

  2. [10]

    Boyd and Lieven Vandenberghe,Convex optimization, Cambridge University Press, 2004

    Stephen P. Boyd and Lieven Vandenberghe,Convex optimization, Cambridge University Press, 2004

  3. [11]

    Stuart, and Urbain Vaes,Accuracy of the ensemble Kalman filter in the near-linear setting, SIAM Journal on Numerical Analysis64(2026), no

    Edoardo Calvello, Pierre Monmarché, Andrew M. Stuart, and Urbain Vaes,Accuracy of the ensemble Kalman filter in the near-linear setting, SIAM Journal on Numerical Analysis64(2026), no. 2, 391–429

  4. [12]

    Louis-Pierre Chaintron and Antoine Diez,Propagation of chaos: A review of models, methods and applications. I. models and methods, Kinetic and Related Models15(2022), no. 6, 895–1015

  5. [13]

    3, 736–746

    Dan Crisan and Arnaud Doucet,A survey of convergence results on particle filtering methods for practitioners, IEEE Transactions on Signal Processing50(2002), no. 3, 736–746

  6. [14]

    2, 1152–1181

    Jana de Wiljes, Sebastian Reich, and Wilhelm Stannat,Long-time stability and accuracy of the ensemble Kalman–Bucy filter for fully observed processes and small measurement noise, SIAM Journal on Applied Dynamical Systems17(2018), no. 2, 1152–1181

  7. [15]

    1, 119–155

    Pierre Del Moral, Aline Kurtzmann, and Julian Tugaut,On the stability and the uniform propagation of chaos of a class of extended ensemble Kalman–Bucy filters, SIAM Journal on Control and Optimization55(2017), no. 1, 119–155

  8. [16]

    2, 790–850

    Pierre Del Moral and Julian Tugaut,On the stability and the uniform propagation of chaos properties of ensemble Kalman–Bucy filters, The Annals of Applied Probability28 (2018), no. 2, 790–850

  9. [17]

    Yukich,Asymptotics for transportation cost in high di- mensions, Journal of Theoretical Probability8(1995), no

    Vladimir Dobrić and Joseph E. Yukich,Asymptotics for transportation cost in high di- mensions, Journal of Theoretical Probability8(1995), no. 1, 97–118

  10. [18]

    Arnaud Doucet, Nando de Freitas, and Neil Gordon,An introduction to sequential Monte Carlo methods, Sequential Monte Carlo Methods in Practice (Arnaud Doucet, Nando de Freitas, and Neil Gordon, eds.), Springer, New York, 2001, pp. 3–14

  11. [19]

    1, 40–50

    Richard Mansfield Dudley,The speed of mean Glivenko–Cantelli convergence, The Annals of Mathematical Statistics40(1969), no. 1, 40–50

  12. [20]

    4, 343–367

    Geir Evensen,The ensemble Kalman filter: Theoretical formulation and practical imple- mentation, Ocean Dynamics53(2003), no. 4, 343–367. Propagation of Chaos for Transport Ensemble Filters 61

  13. [21]

    3–4, 707–738

    Nicolas Fournier and Arnaud Guillin,On the rate of convergence in Wasserstein distance of the empirical measure, Probability Theory and Related Fields162(2015), no. 3–4, 707–738

  14. [22]

    Gordon, David J

    Neil J. Gordon, David J. Salmond, and Adrian F. M. Smith,Novel approach to nonlinear/non-Gaussian Bayesian state estimation, IEE Proceedings F (Radar and Sig- nal Processing)140(1993), no. 2, 107–113

  15. [23]

    Truong-Vinh Hoang, Sebastian Krumscheid, Hermann G. Matthies, and Raúl Tempone, Machine learning-based conditional mean filter: A generalization of the ensemble Kalman filter for nonlinear data assimilation, Foundations of Data Science5(2023), no. 1, 56–80

  16. [24]

    Kakade, and Tong Zhang,A tail inequality for quadratic forms of subgaussian random vectors, Electronic Communications in Probability17(2012), no

    Daniel Hsu, Sham M. Kakade, and Tong Zhang,A tail inequality for quadratic forms of subgaussian random vectors, Electronic Communications in Probability17(2012), no. 52, 1–6

  17. [25]

    FredericJ.N.JorgensenandYoussefM.Marzouk,Exact affine conditioning beyond Gaus- sians: a unique characterization of the ensemble Kalman update, 2025, arXiv preprint arXiv:2510.00158

  18. [26]

    3, University of California Press, 1956, pp

    Mark Kac,Foundations of kinetic theory, Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1954–1955 (Berkeley and Los Angeles) (Jerzy Neyman, ed.), vol. 3, University of California Press, 1956, pp. 171–197

  19. [27]

    Olav Kallenberg,Foundations of modern probability, 2nd ed., Springer, New York, 2002

  20. [28]

    David T. B. Kelly, Kody J. H. Law, and Andrew M. Stuart,Well-posedness and accuracy of the ensemble Kalman filter in discrete and continuous time, Nonlinearity27(2014), no. 10, 2579–2603

  21. [29]

    1, 110–133

    Vladimir Koltchinskii and Karim Lounici,Concentration inequalities and moment bounds for sample covariance operators, Bernoulli23(2017), no. 1, 110–133

  22. [30]

    Evan Kwiatkowski and Jan Mandel,Convergence of the square root ensemble Kalman filter in the large ensemble limit, SIAM/ASA Journal on Uncertainty Quantification3 (2015), no. 1, 1–17

  23. [31]

    Martin Larsson, Jonghwa Park, and Johannes Wiesel,On concentration of the empiri- cal measure for radial transport costs, Stochastic Processes and their Applications178 (2024), 104466

  24. [32]

    62, Springer International Pub- lishing, Cham, 2015

    Kody Law, Andrew Stuart, and Konstantinos Zygalakis,Data assimilation: A mathe- matical introduction, Texts in Applied Mathematics, vol. 62, Springer International Pub- lishing, Cham, 2015

  25. [33]

    Kody J. H. Law, Hamidou Tembine, and Raúl Tempone,Deterministic mean-field en- semble Kalman filtering, SIAM Journal on Scientific Computing38(2016), no. 3, A1251– A1279

  26. [34]

    François Le Gland, Valérie Monbet, and Vu-Duc Tran,Large sample asymptotics for the ensemble Kalman filter, The Oxford Handbook of Nonlinear Filtering (Dan Crisan and Boris Rozovskii, eds.), Oxford University Press, Oxford, 2011, Earlier version: INRIA Research Report RR-7014,...

  27. [35]

    Beezley,On the convergence of the ensemble Kalman filter, Applications of Mathematics56(2011), no

    Jan Mandel, Loren Cobb, and Jonathan D. Beezley,On the convergence of the ensemble Kalman filter, Applications of Mathematics56(2011), no. 6, 533–541. 62 JORGENSEN, BAPTISTA, HOFFMANN, AND MARZOUK

  28. [36]

    Youssef Marzouk, Tarek Moselhy, Matthew Parno, and Alessio Spantini,Sampling via measure transport: An introduction, Handbook of Uncertainty Quantification (Roger Ghanem, David Higdon, and Houman Owhadi, eds.), Springer International Publishing, Cham, 2017, pp. 785–825

  29. [37]

    Henry P. McKean, Jr.,Propagation of chaos for a class of non-linear parabolic equations, Stochastic Differential Equations (Lecture Series in Differential Equations, Session 7, Catholic University, 1967), Air Force Office of Scientific Research, Arlington, VA, 1967, pp. 41–57

  30. [38]

    2, 645–682

    Matthew Parno and Youssef Marzouk,Transport map accelerated Markov chain Monte Carlo, SIAM/ASA Journal on Uncertainty Quantification6(2018), no. 2, 645–682

  31. [39]

    Part II: nonlinear updates, Journal of Computational Physics: X17(2023), 100133

    Maximilian Ramgraber, Ricardo Baptista, Dennis McLaughlin, and Youssef Marzouk, Ensemble transport smoothing. Part II: nonlinear updates, Journal of Computational Physics: X17(2023), 100133

  32. [40]

    4, A2013–A2024

    Sebastian Reich,A nonparametric ensemble transform method for Bayesian inference, SIAM Journal on Scientific Computing35(2013), no. 4, A2013–A2024

  33. [41]

    Sebastian Reich and Colin Cotter,Probabilistic forecasting and Bayesian data assimila- tion, Cambridge University Press, 2015

  34. [42]

    3, 2246–2286

    DanielSanz-AlonsoandNathanWaniorek,Long-time accuracy of ensemble Kalman filters for chaotic dynamical systems and machine-learned dynamical systems, SIAM Journal on Applied Dynamical Systems24(2025), no. 3, 2246–2286

  35. [43]

    4, 921–953

    Alessio Spantini, Ricardo Baptista, and Youssef Marzouk,Coupling techniques for non- linear ensemble filtering, SIAM Review64(2022), no. 4, 921–953

  36. [44]

    1464, Springer, Berlin, 1991, pp

    Alain-Sol Sznitman,Topics in propagation of chaos, École d’Été de Probabilités de Saint- Flour XIX—1989 (Paul-Louis Hennequin, ed.), Lecture Notes in Mathematics, vol. 1464, Springer, Berlin, 1991, pp. 165–251

  37. [45]

    4, 1315–1335

    Kota Takeda and Takashi Sakajo,Uniform error bounds of the ensemble transform Kalman filter for chaotic dynamics with multiplicative covariance inflation, SIAM/ASA Journal on Uncertainty Quantification12(2024), no. 4, 1315–1335

  38. [46]

    Tong, Andrew J

    Xin T. Tong, Andrew J. Majda, and David Kelly,Nonlinear stability of the ensemble Kalman filter with adaptive covariance inflation, Communications in Mathematical Sci- ences14(2016), no. 5, 1283–1313

  39. [47]

    Tong and Matthias Morzfeld,Localized ensemble Kalman inversion, Inverse Prob- lems39(2023), no

    Xin T. Tong and Matthias Morzfeld,Localized ensemble Kalman inversion, Inverse Prob- lems39(2023), no. 6, 064002

  40. [48]

    47, Cambridge University Press, 2018

    Roman Vershynin,High-dimensional probability: An introduction with applications in data science, vol. 47, Cambridge University Press, 2018

  41. [49]

    ,High-dimensional probability: An introduction with applications in data science, 2nd ed., Cambridge University Press, 2026, Pre-publication version dated 19 May 2026, accessed 21 May 2026

  42. [50]

    Wainwright,High-dimensional statistics: A non-asymptotic viewpoint, vol

    Martin J. Wainwright,High-dimensional statistics: A non-asymptotic viewpoint, vol. 48, Cambridge University Press, 2019. Propagation of Chaos for Transport Ensemble Filters 63

  43. [51]

    4A, 2620– 2648

    Jonathan Weed and Francis Bach,Sharp asymptotic and finite-sample rates of conver- gence of empirical measures in Wasserstein distance, Bernoulli25(2019), no. 4A, 2620– 2648

  44. [52]

    Dengfei Zeng and Lijian Jiang,Ensemble transport filter via optimized maximum mean discrepancy, Journal of Computational Physics548(2026), 114582. Department of Mathematics, Massachusetts Institute of Technology, MA, USA Email address:fjorgen@mit.edu Department of Statistical ...

Pith tools

Reviewed June 25, 2026 · model on record in the stance chip above.