Wasserstein and Convex Gaussian Approximations for Non-stationary Time Series of Diverging Dimensionality

Jun Yang; Miaoshiqi Liu; Zhou Zhou

REVIEW 2 major objections 4 minor 40 references

Wasserstein and Convex Gaussian Approximations for Non-stationary Time Series of Diverging Dimensionality

T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper proves that normalized sums of a broad class of high-dimensional non-stationary time series are close to a matching Gaussian in 2-Wasserstein distance and uniformly over all convex sets, at rates that are nearly optimal in the…

desk verdict Real new GA bounds for non-stationary high-dimensional time series, but the Wasserstein near-optimal dimension claim is not backed by the proof. read the letter →

arxiv 2506.08723 v1 pith:AWXPGPSD submitted 2025-06-10 math.ST math.PRstat.MEstat.TH

Miaoshiqi Liu , Jun Yang , Zhou Zhou This is my paper

classification math.STmath.PRstat.MEstat.TH MSC 62M1060B1262F40

keywords non-stationarytimeserieshigh-dimensionalinferenceGaussianapproximation2-Wassersteindistanceconvexsetsphysicaldependencemeasuresmultiplierbootstrapcentrallimittheorem

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

This paper tries to establish a general Gaussian approximation for triangular arrays of high-dimensional non-stationary time series: the normalized sum X_n/√n is close, in 2-Wasserstein distance and uniformly over all convex sets, to a Gaussian vector with the same covariance. The rates depend on sample size, dimension, moment order, and the decay of physical dependence; for short memory and light tails they are nearly optimal in n, and the approximation holds while d diverges at rates up to o($n^{{1/2}}$) for Wasserstein distance and o($n^{{2/5}}$) for convex sets. The argument includes a multiplier bootstrap whose validity is proved for both distances, so the Gaussian approximation can be implemented without knowing the dependence structure. If these claims are right, many inference procedures that use Lipschitz or convex functionals of time-series sums—quadratic forms, thresholded estimators, combined L2/L∞ tests—inherit Gaussian limit behavior at near-parametric rates.

What carries the argument

The paper represents a non-stationary d-dimensional series as a triangular array of time-varying Bernoulli shifts x_i = G_i(F_i), and measures dependence by physical dependence coefficients θ_{k,j,q} and their cumulative tail Θ_{m,p}. The proof approximates X_n in stages: truncate coordinates, replace the series by an M-dependent approximation, divide into blocks whose border innovations are conditioned on, apply a martingale-embedding Gaussian approximation to conditionally independent block sums, and then correct the covariance mismatch using the uniform lower eigenvalue bound λ_*. Truncation is controlled by a new L2-norm truncation lemma with error O(√n $n^{{1/p}}$, which the paper claims is the first optimal-rate L2 truncation bound for time series. The multiplier bootstrap statistic τ_{n,L} = Σ_i B_i ψ_{i,L} uses overlapping block sums ψ_{i,L} and i.i.d. standard normals B_i; its consistency is proved through Gaussian coupling lemmas that compare covariances by Frobenius or max norm.

What would settle it

Build a triangular array where all d coordinates share a common scalar non-stationary process plus independent noise whose variance shrinks like $n^{{-1}}$, so the smallest eigenvalue of Cov(X_n/√n) tends to zero. For growing d, the paper's covariance-correction step would require a blowup of order λ_*^{-1/2}; computing the actual W2 distance, for example with Gaussian innovations where W2 has a closed form, would show whether the claimed O(d $n^{{-1/2}}$ (log n)^5) rate still holds or fails.

Watch

Extended reading notes

Core claim

The central discovery is a pair of explicit bounds. Under finite p-th moments and polynomially decaying dependence, the 2-Wasserstein distance between X_n/√n and a Gaussian vector Y_n/√n with the same covariance is O(d $n^{{1/r-1/2}}$ log n), where r is determined by p and the dependence exponent; under exponential moments and exponentially decaying memory the rate becomes O(d $n^{{-1/2}}$ (log n)^5). For the collection of all convex sets, the distance is bounded by a minimum of two terms and vanishes for d as large as O($n^{{2/5-δ}}$) under sufficiently short memory and light tails. The proof constructs the approximating Gaussian explicitly, then justifies a multiplier bootstrap based on overlapping block sums, so the Gaussian law is not only shown to exist but is accessible computationally.

Load-bearing premise

The load-bearing condition is Assumption 1's uniform lower bound on the smallest eigenvalue of Cov(X_n/√n). The covariance-correction step divides by this eigenvalue, and if it decays with n or approaches zero, the stated Wasserstein and bootstrap error rates collapse through the factor λ_*^{-1/2}.

Editorial extensions

If this is right

For any Lipschitz functional of X_n/√n, the Wasserstein bound controls the difference in expectation, so threshold-type statistics are asymptotically Gaussian with the same covariance.
For combined L2 and L∞ regression tests, the convex Gaussian approximation justifies the multiplier bootstrap critical value under H0 whenever d^2/n → 0 and the moment and dependence assumptions hold.
For thresholded inference, the bootstrap error is bounded explicitly and becomes negligible when d grows slower than n^{1/3} with finite high moments.
The bootstrap is consistent uniformly over all convex sets, not just hyper-rectangles, so inference for quadratic forms, eigenvalue-type statistics, and other non-rectangular regions becomes accessible through one unified procedure.

Reading between the lines

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

Because W2 control is stronger than control in probability, the same bounds should transfer to strong-approximation statements in the Lévy-Prohorov metric for diverging dimension; the paper notes the connection but does not develop it as a separate theorem.
The covariance-correction step depends on the uniform eigenvalue bound, which suggests the method may be adapted to ill-conditioned settings by adding regularization or by replacing λ_* with a data-dependent threshold; a testable extension is to verify whether bootstrap coverage remains valid when λ_* is allowed to decay slowly with n.
The explicit Gaussian couplings in the paper could yield finite-sample confidence sets for functions of the covariance matrix, since Lemma 4.2 gives a constructive coupling rather than an existence statement.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Two results here are worth knowing about. The first is a convex-set Gaussian approximation for non-stationary time series of diverging dimension, with a dimension range that matches the best independent-data result (d up to o(n^{2/5})). The second is a 2-Wasserstein GA with the right n-rate (n^{-1/2} up to logs) under short memory and light tails. The bootstrap theory for both is also new, and the two applications—combined L2/L∞ testing and thresholded inference—are sensible. The appendices do real work; the proofs are long but explicit, and the conditions are stated clearly. No circular fitting shows up; the self-citations are to earlier tools, not to the conclusion. The soft spot is the dimension-dependence claim for the Wasserstein bound. The theorem gives W2 = O(d n^{-1/2} (log n)^5) in the exponential-moment case. That's a correct upper bound, but it is not near-optimal in d. The stress-test example is right: for iid Rademacher vectors with independent coordinates—which satisfy the assumptions—the actual W2 is O(√(d/n)). So the d factor is loose by a factor of √d, and the paper's statement that 'we expect a factor of d to be optimal' is not supported. This is an overstatement in the abstract and Section 3.1, not a flaw in the theorem itself. The convex GA dimension range is fine; it matches known independent-data bounds. The eigenvalue assumption on Cov(X_n/√n) is strong but standard; it shows up in the covariance-correction step and bootstrap lemmas, so if λ* decays with n the rates become worse. Who should read this: anyone working on high-dimensional time series inference, especially for statistics that are convex or Lipschitz functionals. It deserves a serious referee. I'd send it to a good theory journal and ask the authors to temper the near-optimality language and add a comment about the product-measure gap.

Referee Report

2 major / 4 minor

Summary. The paper develops Gaussian approximation (GA) bounds for sums of triangular arrays of d-dimensional non-stationary Bernoulli-shift time series. Theorem 3.1 bounds the 2-Wasserstein distance between the normalized sum and a matched-covariance Gaussian by O(d n^{1/r-1/2} log n) under finite p-th moments and polynomial memory, and by O(d n^{-1/2}(log n)^5) under exponential moments and exponential memory. Theorem 3.2 gives convex-set variation bounds that decay at rates permitting d up to O(n^{2/5-δ}) under short memory and light tails. Section 4 proves consistency of a multiplier bootstrap for both distances via Gaussian coupling lemmas. Sections 5 and 6 apply the theory to combined L2/L∞ regression inference and thresholded inference, with simulations.

Significance. If the bounds and bootstrap results are correct, the paper extends high-dimensional Gaussian approximation beyond hyper-rectangles to all convex sets and to the 2-Wasserstein distance for non-stationary time series, with explicit dependence on d and n and with constructive Gaussian couplings. The appendices are unusually detailed: they include an L2 truncation lemma, martingale embedding, blocking and M-dependence arguments, Stein's method, and bootstrap consistency proofs, and they contain no fitted parameters or circular steps. These are genuine strengths. However, the advertised near-optimality of the W2 dimension dependence and the sufficiency of the conditions in the application theorems both need to be reassessed before the paper is accepted.

major comments (2)

[Theorem 3.1 and Section 3.1] The advertised 'nearly optimal ... with respect to dimensionality' for the W2 rate is not supported by the stated bounds. For iid Rademacher coordinates, Assumption 1(b) and Assumption 2(b) hold, and tensorization gives W2(S_n/√n, N(0,I_d))^2 = d W2_1D(Binomial(n,1/2), N(0,1))^2 ≈ c^2 d/n, so W2 ≈ c√(d/n). The theorem's bound O(d n^{-1/2}(log n)^5) is larger by a factor √d(log n)^5 and diverges for d = n^{0.8}, where the true distance tends to 0. The bound itself remains a valid upper bound, but the statements in the Abstract, Section 1.2, and Section 3.1 that a 'factor of d' is optimal and that the rates are nearly optimal in d are incorrect as written.
[Theorems 5.1 and 5.2] Under the stated condition d^2/n → 0 with fixed p > 4, the displayed upper bounds do not tend to zero, so the claimed asymptotic validity of the bootstrap tests does not follow from those theorems. For example, with d = n^{1/2-ε} and ε sufficiently small, the term d^{7/8} n^{1/p-1/4} in Theorem 5.1 behaves like n^{3/16-7ε/8+1/p}, which diverges for, say, p = 5 and ε = 0.01; the same is true for the d^{3/2} n^{2/p-1/2} term in Theorem 5.2. The proofs in Appendices D and E bound these quantities only in probability and do not make them o(1) under the stated assumptions. Either the dimension condition must be strengthened to a rate such as d = o(n^{2/7-δ}) (with the power depending on p), or the rates in the theorems must be corrected.

minor comments (4)

[Section 2] The notation |·| is used for the Euclidean norm of vectors, the operator norm of matrices, and the absolute value of scalars. This is acceptable after the definitions, but it occasionally makes expressions such as those in Eq. (37) harder to parse; a separate symbol for the operator norm would improve readability.
[Lemma A.3 proof] In the proof of Lemma A.3, the text refers to 'Assumption (i)' and later to '(I)' in the exponential-moment case; these labels should be unified.
[Section 6] The simulation study uses n = 500 and d = 25, giving d^2/n = 1.25, which does not satisfy d^2/n → 0 required by Theorems 5.1 and 5.2. This does not invalidate the simulation results, but the mismatch between the asymptotic condition and the simulation design should be acknowledged.
[Appendix E] There are typographical errors in Appendix E ('Lipstchiz' appears twice), and the long display following Eq. (58) is written without additional parentheses, making it harder to follow than necessary.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Gaussian and convex approximations are derived from external martingale-embedding and Stein techniques, with self-citations only as non-load-bearing technical tools.

full rationale

The derivation chain is not circular. Theorem 3.1 is proved by truncation (new Lemma A.3), M-dependence approximation, blocking, and an extension (Lemma A.2) of the external Eldan-Mikulincer-Zhai martingale-embedding CLT; the Gaussian vector Yn is explicitly constructed with matching covariance, and the covariance-mismatch correction uses the matrix inequality in Lemma F.1 rather than any fitted quantity. Theorem 3.2 combines Bentkus/Fang-Stein smoothing with the Wasserstein estimate, and the appearance of dc(L(X*),L(Y)) on both sides of the inequality is resolved by a contraction argument with a small coefficient, not by assuming the conclusion. The bootstrap results compare covariance matrices via Lemmas 4.2-4.4 and then invoke the GA bounds; no later 'prediction' is fitted to the target quantity. Self-citations such as Zhou (2013, Lemma 1), Zhou (2014, Lemma 6), and Pengel-Yang-Zhou (2024) are used only as technical inequalities or as background; they are not the load-bearing justification for the main theorems, and the paper explicitly notes where it improves on, rather than imports from, prior work (e.g., 'we can extensively use the structure of Bernoulli shifts to get a better rate ... than Pengel, Yang and Zhou (2024)'). Remark A.1 even flags and corrects a minor technical point in Mies and Steland (2023), which is a transparency note rather than a circular step. Separately, the paper's claim that the factor d in Theorem 3.1 is nearly optimal in dimension is questionable: for independent coordinates, tensorization gives W2 ~ sqrt(d/n), so the d n^{-1/2} bound can diverge where the true distance vanishes. That is an optimality/correctness concern, not circularity, and it does not undermine the stated upper bounds under Assumptions 1 and 2.

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

The paper introduces no new physical or probabilistic entities; the Gaussian vector Yn is a standard construction and the bootstrap sum τ_{n,L} is a statistic built from the data. The central claims depend on the stated moment, dependence and eigenvalue assumptions, with no free parameters fitted to data.

assumptions (5)

domain assumption The observed series x_i is generated as a measurable function G_i^{(n)} of a Bernoulli-shift filtration of i.i.d. innovations.
Eq. (4) is the starting model; physical dependence coefficients are defined on this representation. Rosenblatt transform is cited for generality, but all bounds are expressed through these coefficients.
domain assumption The covariance matrix of X_n/√n has smallest eigenvalue at least λ*>0 uniformly in n.
Assumption 1; used in covariance matching (Lemma 4.2), convex Gaussian deviation bound (Lemma 4.4), and the final summary of Theorem 3.1 (Eq. (37)).
domain assumption Each coordinate has a uniformly finite p-th moment for some p>2, or a uniformly finite exponential moment.
Assumption 1(a)/(b); needed for truncation levels and Lemma A.3's L2 truncation bound.
domain assumption Physical dependence coefficients decay polynomially with exponent χ>1 and log factor A>√(χ+1), or exponentially.
Assumption 2(a)/(b); determines the M-dependence approximation, block length m, and final rates.
standard math External benchmark theorems: Eldan-Mikulincer-Zhai Theorem 1, Bentkus (2003), Fang-Koike (2024), Fang (2016), Fang-Röllin Lemma 4.2, Strassen's theorem, van Hemmen-Ando inequality.
Used as accepted tools in Lemmas A.2, B.1, C.1, F.1. They do not presuppose the paper's claims.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Wasserstein and Convex Gaussian Approximations for Non-stationary Time Series of Diverging Dimensionality." pith.science (2026). https://pith.science/paper/AWXPGPSD

@misc{pith2026250608723,
  author       = {Pith},
  title        = {Pith review of: Wasserstein and Convex Gaussian Approximations for Non-stationary Time Series of Diverging Dimensionality},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AWXPGPSD}},
  note         = {Machine review of arXiv:2506.08723}
}

read the original abstract

In high-dimensional time series analysis, Gaussian approximation (GA) schemes under various distance measures or on various collections of subsets of the Euclidean space play a fundamental role in a wide range of statistical inference problems. To date, most GA results for high-dimensional time series are established on hyper-rectangles and their equivalence. In this paper, by considering the 2-Wasserstein distance and the collection of all convex sets, we establish a general GA theory for a broad class of high-dimensional non-stationary (HDNS) time series, extending the scope of problems that can be addressed in HDNS time series analysis. For HDNS time series of sufficiently weak dependence and light tail, the GA rates established in this paper are either nearly optimal with respect to the dimensionality and time series length, or they are nearly identical to the corresponding best-known GA rates established for independent data. A multiplier bootstrap procedure is utilized and theoretically justified to implement our GA theory. We demonstrate by two previously undiscussed time series applications the use of the GA theory and the bootstrap procedure as unified tools for a wide range of statistical inference problems in HDNS time series analysis.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

40 extracted references · 38 canonical work pages

[1]

write newline

" write newline "" before.all 'output.state := FUNCTION format.url url empty "" url if FUNCTION article output.bibitem format.authors "author" output.check author format.key output output.year.check new.block format.title "title" output.check new.block crossref missing format.jour.vol output format.article.crossref output.nonnull format.pages output if ne...
[2]

barticle [author] Bentkus , V. V. ( 1986 ). Dependence of the Berry-Esseen estimate on the dimension . Lithuanian Mathematical Journal 26 110–114 . barticle

work page 1986
[3]

( 2003 )

barticle [author] Bentkus , Vidmantas V. ( 2003 ). On the dependence of the B erry-- E sseen bound on dimension . Journal of Statistical Planning and Inference 113 385--402 . barticle

work page 2003
[4]

, Liu , Weidong W

barticle [author] Berkes , Istv \'a n I. , Liu , Weidong W. Wu , Wei Biao W. B. ( 2014 ). Koml \'o s--Major--Tusn \'a dy approximation under dependence . The Annals of Probability 42 794--817 . barticle

work page 2014
[5]

, Karmakar , Sayar S

barticle [author] Bonnerjee , Soham S. , Karmakar , Sayar S. Wu , Wei Biao W. B. ( 2024 ). Gaussian approximation for nonstationary time series with optimal rate and explicit construction . The Annals of Statistics 52 2293--2317 . barticle

work page 2024
[6]

, Chen , Xiaohui X

barticle [author] Chang , Jinyuan J. , Chen , Xiaohui X. Wu , Mingcong M. ( 2024 ). Central limit theorems for high dimensional dependent data . Bernoulli 30 712–742 . barticle

work page 2024
[7]

, Chetverikov , Denis D

barticle [author] Chernozhukov , Victor V. , Chetverikov , Denis D. Kato , Kengo K. ( 2015 ). Comparison and anti-concentration bounds for maxima of G aussian random vectors . Probability Theory and Related Fields 162 47--70 . barticle

work page 2015
[8]

, Chetverikov , Denis D

barticle [author] Chernozhukov , Victor V. , Chetverikov , Denis D. Kato , Kengo K. ( 2017 ). Central Limit Theorems and Bootstrap in High Dimensions . The Annals of Probability 45 2309–2352 . barticle

work page 2017

Show all 40 references

[9]

Zhou , Zhou Z

barticle [author] Cui , Yan Y. Zhou , Zhou Z. ( 2023 ). Simultaneous Inference for Time Series Functional Linear Regression . arXiv:2207.11392 . barticle

2023 arXiv
[10]

, Mehrabian , Abbas A

barticle [author] Devroye , Luc L. , Mehrabian , Abbas A. Reddad , Tommy T. ( 2018 ). The total variation distance between high-dimensional Gaussians with the same mean . arXiv preprint arXiv:1810.08693 . barticle

2018 arXiv
[11]

barticle [author] Donoho , David L. D. L. Johnstone , Iain M. I. M. ( 1995 ). Adapting to Unknown Smoothness via Wavelet Shrinkage . Journal of the American Statistical Association 90 1200–1224 . barticle

1995
[12]

( 1989 )

barticle [author] Einmahl , Uwe U. ( 1989 ). Extensions of results of Koml \'o s, Major, and Tusn \'a dy to the multivariate case . Journal of multivariate analysis 28 20--68 . barticle

1989
[13]

, Mikulincer , Dan D

barticle [author] Eldan , Ronen R. , Mikulincer , Dan D. Zhai , Alex A. ( 2020 ). The CLT in high dimensions: Quantitative bounds via martingale embedding . The Annals of Probability 48 2494 -- 2524 . barticle

2020
[14]

, Liao , Yuan Y

barticle [author] Fan , Jianqing J. , Liao , Yuan Y. Yao , Jiawei J. ( 2015 ). Power enhancement in high-dimensional cross-sectional tests . Econometrica 83 1497--1541 . barticle

2015
[15]

( 2016 )

barticle [author] Fang , Xiao X. ( 2016 ). A Multivariate CLT for Bounded Decomposable Random Vectors with the Best Known Rate . Journal of Theoretical Probability 29 1510--1523 . barticle

2016
[16]

Koike , Yuta Y

barticle [author] Fang , Xiao X. Koike , Yuta Y. ( 2024 ). Large-Dimensional Central Limit Theorem with Fourth-Moment Error Bounds on Convex Sets and Balls . The Annals of Applied Probability 34 2065--2106 . barticle

2024
[17]

R\" o llin , Adrian A

barticle [author] Fang , Xiao X. R\" o llin , Adrian A. ( 2015 ). Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics . Bernoulli 21 2157--2189 . barticle

2015
[18]

, Jiang , Tiefeng T

barticle [author] Feng , Long L. , Jiang , Tiefeng T. , Li , Xiaoyun X. Liu , Binghui B. ( 2024 ). Asymptotic independence of the sum and maximum of dependent random variables with applications to high-dimensional tests . Statistica Sinica 1745--1763 . barticle

2024
[19]

barticle [author] G\" o tze , F. F. ( 1991 ). On the Rate of Convergence in the Multivariate CLT . The Annals of Probability 19 724–739 . barticle

1991
[20]

Wu , Wei Biao W

barticle [author] Karmakar , Sayar S. Wu , Wei Biao W. B. ( 2020 ). Optimal Gaussian approximation for multiple time series . Statistica Sinica 30 1399--1417 . barticle

2020
[21]

, Major , P \'e ter P

barticle [author] Koml \'o s , J \'a nos J. , Major , P \'e ter P. Tusn \'a dy , G \'a bor G. ( 1975 ). An approximation of partial sums of independent RV'-s, and the sample DF. I . Zeitschrift f \"u r Wahrscheinlichkeitstheorie und verwandte Gebiete 32 111--131 . barticle

1975
[22]

barticle [author] Koml \'o s , J. J. , Major , P. P. Tusn \'a dy , G. G. ( 1976 ). An approximation of partial sums of independent RV’s , and the sample DF. II . Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 34 33–58 . barticle

1976
[23]

Lin , Zhengyan Z

barticle [author] Liu , Weidong W. Lin , Zhengyan Z. ( 2009 ). Strong approximation for a class of stationary processes . Stochastic Processes and their Applications 119 249--280 . barticle

2009
[24]

Steland , Ansgar A

barticle [author] Mies , Fabian F. Steland , Ansgar A. ( 2023 ). Sequential Gaussian approximation for nonstationary time series in high dimensions . Bernoulli 29 3114--3140 . barticle

2023
[25]

binbook [author] Nagaev , S. V. S. V. ( 1976 ). An estimate of the remainder term in the multidimensional central limit theorem . In Proceedings of the Third Japan — USSR Symposium on Probability Theory . Lecture Notes in Mathematics 550 419–438 . Springer Berlin Heidelberg , ...

1976
[26]

, Yang , Jun J

barticle [author] Pengel , Ardjen A. , Yang , Jun J. Zhou , Zhou Z. ( 2024 ). Gaussian Approximation and Output Analysis for High-Dimensional MCMC . arXiv preprint arXiv:2407.05492 . barticle

2024 arXiv
[27]

( 2001 )

bbook [author] Pollard , David D. ( 2001 ). A User's Guide to Measure Theoretic Probability . Cambridge Series in Statistical and Probabilistic Mathematics . Cambridge University Press . bbook

2001
[28]

( 1952 )

barticle [author] Rosenblatt , Murray M. ( 1952 ). Remarks on a multivariate transformation . The Annals of Mathematical Statistics 23 470--472 . barticle

1952
[29]

( 2009 )

binbook [author] St \'e phane , Mallat M. ( 2009 ). CHAPTER 11 - Denoising In A Wavelet Tour of Signal Processing (Third Edition) 535–610 . Academic Press , Boston . binbook

2009
[30]

barticle [author] van Hemmen , J Leo J. L. Ando , Tsuneya T. ( 1980 ). An inequality for trace ideals . Communications in Mathematical Physics 76 143--148 . barticle

1980
[31]

, Wu , Qiang Q

binbook [author] Wang , Yu-Ping Y.-P. , Wu , Qiang Q. Castleman , Kenneth R. K. R. ( 2023 ). Image Enhancement In Microscope Image Processing 55–74 . Elsevier . binbook

2023
[32]

barticle [author] Wu , W. B. W. B. ( 2005 ). Nonlinear system theory: Another look at dependence . Proceedings of the National Academy of Sciences 102 14150--14154 . barticle

2005
[33]

barticle [author] Wu , Wei Biao W. B. Zhou , Zhou Z. ( 2011 ). Gaussian approximations for non-stationary multiple time series . Statistica Sinica 1397--1413 . barticle

2011
[34]

Zhou , Zhou Z

barticle [author] Wu , Hau-Tieng H.-T. Zhou , Zhou Z. ( 2024 ). Frequency Detection and Change Point Estimation for Time Series of Complex Oscillation . Journal of the American Statistical Association 119 1945--1956 . barticle

2024
[35]

barticle [author] Zaitsev , A Yu A. Y. ( 2007 ). Estimates for the rate of strong approximation in the multidimensional invariance principle . Journal of Mathematical Sciences 145 4856--4865 . barticle

2007
[36]

( 2018 )

barticle [author] Zhai , Alex A. ( 2018 ). A high-dimensional CLT in W_2 distance with near optimal convergence rate . Probability Theory and Related Fields 170 821--845 . barticle

2018
[37]

Cheng , Guang G

barticle [author] Zhang , Xianyang X. Cheng , Guang G. ( 2018 ). Gaussian approximation for high dimensional vector under physical dependence . Bernoulli 24 2640--2675 . barticle

2018
[38]

Wu , Wei Biao W

barticle [author] Zhang , Danna D. Wu , Wei Biao W. B. ( 2017 ). Gaussian approximation for high dimensional time series . The Annals of Statistics 45 1895--1919 . barticle

2017
[39]

( 2013 )

barticle [author] Zhou , Zhou Z. ( 2013 ). Heteroscedasticity and autocorrelation robust structural change detection . Journal of the American Statistical Association 108 726--740 . barticle

2013
[40]

barticle [author] Zhou , Z. Z. ( 2014 ). Inference of weighted V -statistics for nonstationary time series and its applications . The Annals of Statistics 42 87--114 . barticle

2014

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [1]

write newline

" write newline "" before.all 'output.state := FUNCTION format.url url empty "" url if FUNCTION article output.bibitem format.authors "author" output.check author format.key output output.year.check new.block format.title "title" output.check new.block crossref missing format.jour.vol output format.article.crossref output.nonnull format.pages output if ne...

[2] [2]

barticle [author] Bentkus , V. V. ( 1986 ). Dependence of the Berry-Esseen estimate on the dimension . Lithuanian Mathematical Journal 26 110–114 . barticle

work page 1986

[3] [3]

( 2003 )

barticle [author] Bentkus , Vidmantas V. ( 2003 ). On the dependence of the B erry-- E sseen bound on dimension . Journal of Statistical Planning and Inference 113 385--402 . barticle

work page 2003

[4] [4]

, Liu , Weidong W

barticle [author] Berkes , Istv \'a n I. , Liu , Weidong W. Wu , Wei Biao W. B. ( 2014 ). Koml \'o s--Major--Tusn \'a dy approximation under dependence . The Annals of Probability 42 794--817 . barticle

work page 2014

[5] [5]

, Karmakar , Sayar S

barticle [author] Bonnerjee , Soham S. , Karmakar , Sayar S. Wu , Wei Biao W. B. ( 2024 ). Gaussian approximation for nonstationary time series with optimal rate and explicit construction . The Annals of Statistics 52 2293--2317 . barticle

work page 2024

[6] [6]

, Chen , Xiaohui X

barticle [author] Chang , Jinyuan J. , Chen , Xiaohui X. Wu , Mingcong M. ( 2024 ). Central limit theorems for high dimensional dependent data . Bernoulli 30 712–742 . barticle

work page 2024

[7] [7]

, Chetverikov , Denis D

barticle [author] Chernozhukov , Victor V. , Chetverikov , Denis D. Kato , Kengo K. ( 2015 ). Comparison and anti-concentration bounds for maxima of G aussian random vectors . Probability Theory and Related Fields 162 47--70 . barticle

work page 2015

[8] [8]

, Chetverikov , Denis D

barticle [author] Chernozhukov , Victor V. , Chetverikov , Denis D. Kato , Kengo K. ( 2017 ). Central Limit Theorems and Bootstrap in High Dimensions . The Annals of Probability 45 2309–2352 . barticle

work page 2017