Pith. sign in

REVIEW 4 major objections 4 minor 2 cited by

BdryGP: a new Gaussian process model for incorporating boundary information

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

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

Pith's one-line read Boundary-aware Gaussian process emulators converge at 1/n error on sparse grids

desk verdict A genuinely new boundary-aware GP model with a promising FEM connection, but the headline Lp rate is not proven: Lemma 3 is false as stated, so the O(n^-1) claim should be downgraded unless the regularity assumption is added. read the letter →

arxiv 1908.08868 v1 pith:AZGL5MGN submitted 2019-08-23 stat.ME math.STstat.TH

Liang Ding , Simon Mak , C. F. Jeff Wu This is my paper · ORCID
classification stat.MEmath.STstat.TH MSC 62G0862M40
keywords GaussianprocessKrigingboundaryinformationDirichletsparsegridsfinite-elementmodelingconvergenceratescomputerexperiments
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 proposes BdryGP, a Gaussian process model that uses known boundary values of a simulator's output to improve emulation. Its central claim is that when at least one boundary value is known for every input variable, the BdryGP predictor on a sparse grid converges to the true function at rate $O(n^{-1})$ in every $L_p$ norm with $p<\infty$, and at $O(n^{-1}[\log n]^{2(d-1)})$ uniformly, where $n$ is the sample size. These rates are far faster than standard GP rates without boundary information, which typically decay like $n^{-1/(2d)}$, and the dimension enters only through a logarithmic factor. The proof works by showing an exact equivalence between BdryGP interpolation and finite-element interpolation with piecewise-linear hat functions, then importing sparse-grid error bounds from numerical analysis.

What carries the argument

The load-bearing object is the BdryMatérn covariance function, a product of one-dimensional kernels that vanish on known boundaries and reduce to the Matérn-1/2 kernel on coordinates with no boundary information. Its limiting Brownian kernel, built from products of Brownian-bridge and Brownian-motion covariances, makes the GP posterior mean exactly equal to a finite-element interpolant with piecewise-linear hat functions on both full and sparse grids. That equivalence transfers sparse-grid approximation theory into GP error bounds. The proof chain uses four equivalent function spaces: the RKHS of the Brownian kernel, the RKHS of the BdryMatérn kernel, the constrained mixed Sobolev space $H^{1,c}_{\mathrm{mix}}$, and the limiting finite-element space; hierarchical surplus decompositions then bound the tail of the multilevel projection.

What would settle it

For $d=1$ with a known left boundary $f(0)=0$, take $f(x)=x^{3/4}$, which lies in $H^{1,c}_{\mathrm{mix}}$ but whose derivative has a mild singularity at $0$. Compute the hierarchical surpluses on uniform grids of spacing $2^{-\alpha}$; if $|c_{\alpha,\beta}|$ fails to decay as fast as $2^{-(1+\gamma)\alpha}$ for any $\gamma>0$, the supporting surplus lemma is false and the theorem's rate would not hold for every function in $H^{1,c}_{\mathrm{mix}}$.

Watch

Extended reading notes

Core claim

The central discovery is that incorporating Dirichlet boundary information through a specially designed covariance function can remove the curse of dimensionality from emulator convergence rates, under sparse-grid designs. For any fixed function in the constrained mixed first-order Sobolev space $H^{1,c}_{\mathrm{mix}}$, the BdryGP predictor satisfies $\|f-\hat{f}^{\mathrm{BM}}_n\|_{L_p}=O(n^{-1})$ for $1\le p<\infty$ and $\|f-\hat{f}^{\mathrm{BM}}_n\|_{L_\infty}=O(n^{-1}[\log n]^{2(d-1)})$. The paper also proves a probabilistic uniform bound $O_P(n^{-1}[\log n]^{2d-3/2})$ for random functions drawn from a GP whose sample paths lie in that space. These rates hold provided at least one boundary value is known for each coordinate and the design is a sparse grid; the authors verify the predicted $O(2^{-k})$ versus $O(2^{-k/2})$ error gap numerically on three ten-dimensional test functions.

Load-bearing premise

The proof assumes that near each grid point the first derivative of $f$ changes with a fixed power-law smoothness; belonging to the mixed Sobolev space alone does not guarantee such smoothness, and the $O(n^{-1})$ rate rests on that extra assumption.

Editorial extensions

If this is right

  • Emulating expensive computer models with known boundary physics requires far fewer simulation runs for a target error than standard GP emulation.
  • The $L_p$ rate $O(n^{-1})$ is independent of dimension in the exponent, so increasing the number of input variables does not slow convergence on sparse grids, unlike standard nonparametric rates.
  • The uniform error bound retains only a logarithmic dependence on dimension, keeping boundary-aware emulators practical for high-dimensional inputs.
  • The equivalence with finite elements suggests predictions can be formed without inverting dense kernel matrices, a direct computational route the paper identifies as a future step.
  • For functions in the smoother space $H^{2,c}_{\mathrm{mix}}$, the same proof strategy yields an $L_2$ rate $O(n^{-2}[\log n]^{d-1})$.

Reading between the lines

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

  • Not tested in the paper: estimate the wavelength parameters by maximum likelihood and check whether the $O(n^{-1})$ rate survives parameter-estimation error, since the theory treats wavelengths as fixed.
  • One consequence the authors leave implicit is that the finite-element equivalence turns BdryGP into a deterministic sparse-grid interpolation algorithm; implementing it directly would avoid all kernel matrix inversions at large $n$.
  • A stress test for the theory would use functions in $H^{1,c}_{\mathrm{mix}}$ with rapidly oscillating or mildly singular derivatives; the proof's surplus bound suggests performance degrades precisely where the extra smoothness assumption fails.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 4 minor

Summary. The paper proposes BdryGP, a Gaussian process model that incorporates Dirichlet boundary information through a new BdryMatérn covariance kernel. The main theoretical claims are a deterministic Lp convergence rate of O(n^{-1}) for any function in the constrained mixed Sobolev space H1,c_mix under sparse grid designs, a uniform L∞ rate of O(n^{-1}[log n]^{2(d-1)}), and a probabilistic uniform rate of OP(n^{-1}[log n]^{2d-3/2}). The proofs proceed by establishing an equivalence between the Brownian-kernel GP predictor and finite-element interpolation, then transferring finite-element error bounds to the BdryMatérn kernel. Numerical experiments with d=10 test functions are provided to illustrate the improved error decay.

Significance. If the main theorem were correct, the result would be striking: boundary information would reduce the nonparametric regression error from rates that degrade exponentially in dimension to a dimension-free Lp rate of O(n^{-1}), a genuine contribution to GP emulation. The paper also contains a suggestive and potentially useful structural idea, namely the connection between Brownian-kernel GP interpolation and finite-element interpolation under sparse grids, and it states explicit formulas for the BdryMatérn kernel and its Brownian-kernel limit. However, the central rate theorem relies on a regularity assertion about hierarchical surpluses that is false for the stated function class, and the proof of the transfer step between the Brownian-kernel and BdryMatérn-kernel predictors uses an inequality in the wrong direction. These are load-bearing issues, not presentation problems.

major comments (4)
  1. [Appendix A.3, Lemma 3] The proof of Lemma 3 requires the uniform Hölder-type bound ∫_x^{x+h} |D1 f(s) - D1 f(s-h)| ds ≤ C h^{1+γ} for f ∈ H1,c_mix. This is not a consequence of H1 membership, and the density argument in A.3 does not make the constants uniform: approximating f by smooth functions g_n makes the first integral small only after taking n large, while the constant in the Hölder bound for D1 g_n may grow with n, so no single γ>0 survives. A concrete counterexample is f(x)=x log x on [0,1] with f(0)=0; this function lies in H1,c_mix, but near zero the one-sided difference f(h)-2f(0)+f(2h) is of order h log h, so the first-level hierarchical surplus is of order 2^{-α}, not 2^{-(1+γ)α}. Thus inequality (47) is false as stated. Without (47), the Lp summation in the proof of Theorem 5 yields only O(n^{-1}[log n]^{2(d-1)}) instead of the advertised O(n^{-1}), so the main Lp rate is not established.
  2. [Lemma 3, inequality (48)] The second part of Lemma 3, asserting sup_{β∈B_α} |c_{α,β}| ≤ C 2^{-|α|}, is also not a consequence of H1,c_mix. For d=1 and f(x)=x^a with 1/2 < a < 1, one has f(0)=0 and f ∈ H1(0,1), but the surplus at the first cell is of order 2^{-a α}, which is not bounded by C 2^{-α}. The final line of the proof in A.3 bounds an integral of |D1 f(s) - D1 f(s-h)| by a constant times the L2 norm without the necessary factor of h; the correct Cauchy-Schwarz estimate gives a factor h^{1/2}. Therefore the lemma overstates what H1 membership implies, and the proof of Theorem 5 cannot be repaired by a local correction.
  3. [Theorem 3 and its use in Theorem 5] Theorem 3 as stated, equation (34), says ||f - f̂BR_n||_{L∞} ≤ C ||f - f̂BM_n||_{L∞}: the Brownian-kernel error is bounded by the BdryMatérn-kernel error. But the proof of Theorem 5 first establishes rates for ||f - f̂BR_n|| and then concludes the same rates for ||f - f̂BM_n||; this requires the opposite inequality, ||f - f̂BM_n|| ≤ C ||f - f̂BR_n||. The proof in Appendix A.2 actually derives f - f̂BM_n = O(Σ_{|α|≥k+d} f_α), which is the reverse statement. Hence the theorem statement, its proof, and its use in the main-rate proof are mutually inconsistent.
  4. [Theorem 6] Theorem 6's probabilistic uniform rate inherits the pointwise uniform bound from Theorem 5 via the natural-distance argument. Since the uniform bound in Theorem 5 is not established for the stated function class — the L∞ rate in (46) depends on Lemma 3, whose regularity assumption fails — the probabilistic rate in equations (57)-(58) is also unsupported.
minor comments (4)
  1. [Section 5.1, proof of Theorem 5] The final line of the proof says 'the Lp and L∞ convergence rates for ||f - f̂BR_n|| also hold for the BdryGP error ||f - f̂BR_n||'; the second norm should evidently be ||f - f̂BM_n||. Also, the phrase 'constive constant' should read 'positive constant'.
  2. [Section 2.4.1, equation (11)] In the displayed definition of the 1-d BdryMatérn kernel, all four lines are labeled with the same condition 'j ∈ I[0] ∩ I[1]'. The four cases should distinguish the full, left, right, and none boundary-information settings, respectively.
  3. [Section 3.3, Theorem 3] The phrase 'for any ω>0' in Theorem 3 is not reflected in the proof, which uses a Taylor expansion of sinh(ω h) and appears to require h small relative to ω; the statement should specify the dependence of the constant C on ω, or the proof should be adapted.
  4. [Appendix A.5, Theorem 7] In the proof, the displayed inequality '∫_0^1 |f(x+δ)-f(x)|^p dx ≤ δ^{1/2} ||f'||_{L2}' is written without the exponent p on the right-hand side; as written it is dimensionally inconsistent. This appendix is not central to the main claims, but the display should be corrected.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the rate proof is self-contained and the cited prior result is independent support.

full rationale

The claimed derivation chain runs from the BdryMatérn kernel (Eq. 11), defined by solving the Matérn-1/2 Green's-function problem under Dirichlet boundary conditions (Prop. 1), through the Brownian-kernel limit (Eq. 13), the FEM equivalence (Theorems 1-2), the function-space equivalences (Theorem 4), and the hierarchical-surplus bounds (Lemma 3) to the Lp and L∞ rates (Theorem 5). No step reduces an output to an input by construction: the BdryMatérn kernel is not defined in terms of the rates; the Brownian kernel is a limiting covariance, not the target predictor; the FEM interpolator is an independent object proved equivalent to the Brownian-kernel GP predictor. The one author-overlapping citation, Theorem 2 of Ding and Zhang (2018), supplies the explicit tridiagonal inverse of the Brownian covariance matrix in the 1-d base case of Theorem 1. This is a parameter-free auxiliary identity about a covariance matrix, not a statement of the target convergence rates, so it is independent support rather than a self-citation chain that forces the conclusion. The numerical experiments fix ω=1.0 only in simulations; the theorems allow arbitrary ω>0, so no fitted constant is renamed as a prediction. Two genuine concerns appear in the paper, but they are correctness risks, not circularity: Lemma 3 (Appendix A.3, Eq. 47) asserts a uniform Hölder-type bound on D1f that H1 membership does not imply, and Theorem 3 (Section 3.3, Eq. 34) states an inequality direction opposite to the one used to transfer Brownian-kernel rates to BdryGP, although Appendix A.2 appears to prove the needed direction. A failure of Lemma 3 or a mismatch in Theorem 3 would make the proof unsupported, but neither amounts to deriving the conclusion from itself. Since no specific reduction of a 'prediction' to its inputs is exhibited, the circularity score is 0.

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

The central rate theorem depends on one ad hoc regularity assumption in Lemma 3 that is not stated in the main text. Other premises are standard domain assumptions of the paper's setting: known Dirichlet boundaries, mixed Sobolev regularity, sparse grid designs, and cited FEM results. The numerical simulations introduce a hand-chosen wavelength omega = 1.0 but that does not affect the theoretical rates.

free parameters (2)
  • Wavelength omega = 1.0 (in numerical experiments only)
    The theorems state a rate for any omega > 0, so omega is not fitted in the theory. In Section 6, all models fix omega = 1.0; the simulations do not tune it. This parameter is therefore not load-bearing for the central claim.
  • Mean-function RBF smoothness nu = unspecified
    Section 2.3 picks phi(x1,x2) = max{(1 - ||x1-x2||)^nu, 0} and says it works well in practice; nu is a hand choice in the mean construction, but the convergence theorems do not depend on its value.
assumptions (6)
  • domain assumption Dirichlet boundary values F_j^0 and F_j^1 are known for each variable with I[0] union I[1] = [d].
    Equation (1) and Section 2.2; the whole construction and rates require at least one known boundary per variable.
  • domain assumption The target function f lies in H1,c_mix, the constrained mixed Sobolev space with zero boundary on known boundaries.
    Section 4.1, equation (36); this is a smaller space than the H1 space used in the comparison rates.
  • domain assumption Design points follow a sparse grid X_k^SP; the nested full-grid FEM error decomposition applies.
    Equation (32) and Theorems 2 and 5; rates are only for sparse grids, not arbitrary designs.
  • ad hoc to paper Lemma 3 requires a Holder-type bound integral_x^(x+h) |D1 f(s) - D1 f(s-h)| ds <= C h^(1+gamma) for f in H1,c_mix.
    Appendix A.3 assumes this after a density argument, but H1 membership does not imply it; constants may depend on the approximating sequence. This is an unstated regularity assumption behind Theorem 5.
  • domain assumption The BdryGP centered process has zero boundary conditions because the mean absorbs known boundary values.
    Sections 2.3 and 2.4; this lets proofs assume f = 0 on boundaries.
  • standard math Standard finite element and sparse grid results from Bungartz-Griebel (2004), Rieger-Wendland (2017), Plumlee (2014), and Wang-Tuo-Wu (2018) hold as cited.
    Used in Lemmas 2, Theorems 2 and 6; accepted background.

how reviews work

0 comments
Cite this review

Pith. "Pith review of BdryGP: a new Gaussian process model for incorporating boundary information." pith.science (2026). https://pith.science/paper/AZGL5MGN

@misc{pith2026190808868,
  author       = {Pith},
  title        = {Pith review of: BdryGP: a new Gaussian process model for incorporating boundary information},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AZGL5MGN}},
  note         = {Machine review of arXiv:1908.08868}
}
read the original abstract

Gaussian processes (GPs) are widely used as surrogate models for emulating computer code, which simulate complex physical phenomena. In many problems, additional boundary information (i.e., the behavior of the phenomena along input boundaries) is known beforehand, either from governing physics or scientific knowledge. While there has been recent work on incorporating boundary information within GPs, such models do not provide theoretical insights on improved convergence rates. To this end, we propose a new GP model, called BdryGP, for incorporating boundary information. We show that BdryGP not only has improved convergence rates over existing GP models (which do not incorporate boundaries), but is also more resistant to the "curse-of-dimensionality" in nonparametric regression. Our proofs make use of a novel connection between GP interpolation and finite-element modeling.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-output Orthogonal Gaussian Processes for Noisy Simulator Outputs

    stat.ME 2026-07 conditional novelty 6.0 of 10

    MOOGP extends orthogonal Gaussian processes to multi-output simulators, improving trend coefficient identifiability while retaining predictive accuracy.

  2. The BdryMat\'ern GP: Reliable incorporation of boundary information on irregular domains for Gaussian process modeling

    stat.ME 2025-07 conditional novelty 6.0 of 10

    A new Gaussian process kernel, derived from a stochastic PDE with boundary conditions, enforces Dirichlet, Neumann, or Robin boundaries on irregular domains with smoothness control and provable approximation error.

Reference graph

Works this paper leans on

40 extracted references · 38 canonical work pages · cited by 2 Pith papers

  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]

    Stegun , Irene A I

    bbook [author] Abramowitz , Milton M. Stegun , Irene A I. A. ( 1965 ). Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables . Courier Corporation . bbook

    work page 1965

  3. [3]

    bbook [author] Adler , R. J. R. J. ( 1981 ). The Geometry of Random Fields . Wiley . bbook

    work page 1981

  4. [4]

    , Novak , Erich E

    barticle [author] Barthelmann , Volker V. , Novak , Erich E. Ritter , Klaus K. ( 2000 ). High dimensional polynomial interpolation on sparse grids . Advances in Computational Mathematics 12 273–288 . barticle

    work page 2000

  5. [5]

    Hughes , Thomas JR T

    barticle [author] Bazilevs , Yuri Y. Hughes , Thomas JR T. J. ( 2007 ). Weak imposition of Dirichlet boundary conditions in fluid mechanics . Computers & Fluids 36 12-26 . barticle

    work page 2007

  6. [6]

    Griebel , Michael M

    barticle [author] Bungartz , Hans-Joachim H.-J. Griebel , Michael M. ( 2004 ). Sparse Grids . Acta Numerica 13 1-123 . barticle

    work page 2004

  7. [7]

    ( 1991 )

    bbook [author] Cressie , Noel N. ( 1991 ). Statistics for Spatial Data , 2 ed. Wiley-Interscience . bbook

    work page 1991

  8. [8]

    barticle [author] Dick , J. J. , Kuo , F. Y. F. Y. Sloan , I. H. I. H. ( 2013 ). High-dimensional integration: The quasi-Monte Carlo way . Acta Numerica 22 133-288 . barticle

    work page 2013

Show all 40 references
  1. [9]

    barticle [author] Ding , L. L. Zhang , X. X. ( 2018 ). Scalable Stochastic Kriging with Markovian Covariances . arXiv preprint . https://arxiv.org/abs/1803.02575 . barticle

    2018 arXiv

  2. [10]

    bbook [author] Evans , L. C. L. C. ( 2015 ). Partial Differential Equations , 2nd ed. AMS . bbook

    2015

  3. [11]

    ( 2012 )

    bbook [author] Garcke , Jochen J. ( 2012 ). Sparse Grids in a Nutshell . Springer . bbook

    2012

  4. [12]

    ( 2011 )

    barticle [author] Geenens , Gery G. ( 2011 ). Curse of dimensionality and related issues in nonparametric functional regression . Statistics Surveys 5 30--43 . barticle

    2011

  5. [13]

    , Bingham , Derek D

    barticle [author] Goh , Joslin J. , Bingham , Derek D. , Holloway , James Paul J. P. , Grosskopf , Michael J M. J. , Kuranz , Carolyn C C. C. Rutter , Erica E. ( 2013 ). Prediction and computer model calibration using outputs from multifidelity simulators . Technometrics 55 50...

    2013

  6. [14]

    barticle [author] Golchi , S. S. , Bingham , D. R. D. R. , Chipman , H. H. Campbell , D. A. D. A. ( 2015 ). Monotone emulation of computer experiments . SIAM/ASA Journal on Uncertainty Quantification 3 370-392 . barticle

    2015

  7. [15]

    bbook [author] Gu , C. C. ( 2002 ). Smoothing Spline ANOVA Models . Springer . bbook

    2002

  8. [16]

    Delange , Sherry L S

    bbook [author] Humphrey , JAYD J. Delange , Sherry L S. L. ( 2016 ). Introduction to Biomechanics . Springer . bbook

    2016

  9. [17]

    barticle [author] Kaufman , Cari G C. G. , Bingham , Derek D. , Habib , Salman S. , Heitmann , Katrin K. Frieman , Joshua A J. A. ( 2011 ). Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology . The Annal...

    2011

  10. [18]

    ( 2001 )

    barticle [author] Kiehn , RM R. ( 2001 ). Some closed form solutions to the Navier Stokes equations . arXiv preprint . https://arxiv.org/abs/physics/0102002 . barticle

    2001 arXiv

  11. [19]

    barticle [author] Mak , S. S. , Sung , C. L. C. L. , Yeh , S. T. S. T. , Wang , X. X. , Chang , Y. H. Y. H. , Joseph , V. R. V. R. , Yang , Y. Y. Wu , C. F. J. C. F. J. ( 2018 ). An efficient surrogate model for emulation and physics extraction of large eddy simulations . Jour...

    2018

  12. [20]

    barticle [author] Plumlee , M. M. ( 2014 ). Fast prediction of deterministic functions using sparse grid experimental designs . Journal of the American Statistical Association 109 1581-1591 . barticle

    2014

  13. [21]

    Wendland , Holger H

    barticle [author] Rieger , Christian C. Wendland , Holger H. ( 2017 ). Sampling inequalities for sparse grids . Numerische Mathematik 136 439–466 . barticle

    2017

  14. [22]

    bbook [author] Ritter , K. K. ( 2000 ). Average-Case Analysis of Numerical Problems . Springer . bbook

    2000

  15. [23]

    , Welch , William J W

    barticle [author] Sacks , Jerome J. , Welch , William J W. J. , Mitchell , Toby J T. J. Wynn , Henry P H. P. ( 1989 ). Design and analysis of computer experiments . Statistical Science 4 409-423 . barticle

    1989

  16. [24]

    bbook [author] Santner , Thomas J T. J. , Williams , Brian J B. J. Notz , William I W. I. ( 2003 ). The Design and Analysis of Computer Experiments . Springer . bbook

    2003

  17. [25]

    barticle [author] Stein , M. L. M. L. ( 1999 ). Uniform asymptotic optimality of linear predictions of a random field using an incorrect second-order structure . The Annals of Statistics 18 850-872 . barticle

    1999

  18. [26]

    barticle [author] Stone , C. J. C. J. ( 1982 ). Optimal Global Rates of Convergence for Nonparametric Regression . Annals of Statistics 8 1348-1360 . barticle

    1982

  19. [27]

    bmisc [author] Surjanovic , S. S. Bingham , D. D. ( 2016 ). Virtual Library of Simulation Experiments: Test Functions and Datasets . https://www.sfu.ca/ ssurjano/index.html . bmisc

    2016

  20. [28]

    barticle [author] Tan , Matthias H. Y. M. H. Y. ( 2018 ). Gaussian process modeling with boundary information . Statistica Sinica 28 621-648 . barticle

    2018

  21. [29]

    ( 2001 )

    bbook [author] Temam , Roger R. ( 2001 ). Navier-Stokes Equations: Theory and Numerical Analysis 343 . American Mathematical Society . bbook

    2001

  22. [30]

    barticle [author] Tuo , R. R. , Wang , Y. Y. Wu , C. F. Jeff C. F. J. ( 2017 ). Improved rates of convergence for kernel ridge regression, with application to Gaussian process models . Under review for Annals of Statistics . https://docs.google.com/viewer?a=v&pid=sites&srcid=Z...

    2017

  23. [31]

    bbook [author] van de Geer , S. A. S. A. ( 2000 ). Empirical Processes in M-estimation . Cambridge University Press . bbook

    2000

  24. [32]

    barticle [author] Wang , X. X. Berger , J. O. J. O. ( 2016 ). Estimating shape constrained functions using Gaussian processes . SIAM/ASA Journal on Uncertainty Quantification 4 1-25 . barticle

    2016

  25. [33]

    , Tuo , Rui R

    barticle [author] Wang , Wenjia W. , Tuo , Rui R. Wu , C. F. Jeff C. F. J. ( 2018 ). On prediction properties of kriging: uniform error bounds and robustness . Journal of the American Statistical Association, to appear . https://arxiv.org/abs/1710.06959 . barticle

    2018 arXiv

  26. [34]

    bbook [author] Wendland , H. H. ( 2010 ). Scattered Data Approximation , 2nd ed. Cambridge University Press . bbook

    2010

  27. [35]

    barticle [author] Wheeler , M. W. M. W. , Dunson , D. B. D. B. , Pandalai , S. P. S. P. , Baker , B. A. B. A. Herring , A. H. A. H. ( 2014 ). Mechanistic hierarchical G aussian processes . Journal of the American Statistical Association 109 894-904. barticle

    2014

  28. [36]

    bbook [author] White , Frank M F. M. Corfield , Isla I. ( 2006 ). Viscous Fluid Flow . McGraw-Hill New York . bbook

    2006

  29. [37]

    barticle [author] Wu , Z. Z. Schaback , R. R. ( 1993 ). Local error estimates for radial basis function interpolation of scattered data . IMA Journal of Numerical Analysis 13 13-27 . barticle

    1993

  30. [38]

    , Wang , Xingjian X

    barticle [author] Yeh , Shiang-Ting S.-T. , Wang , Xingjian X. , Sung , Chih-Li C.-L. , Mak , Simon S. , Chang , Yu-Hung Y.-H. , Zhang , Liwei L. , Wu , CF Jeff C. J. Yang , Vigor V. ( 2018 ). Common proper orthogonal decomposition-based spatiotemporal emulator for design expl...

    2018

  31. [39]

    barticle [author] Yserentant , H. H. ( 1986 ). On the multi-level splitting of finite element spaces . Numerische Mathematik 49 379-412 . barticle

    1986

  32. [40]

    bbook [author] Zaitsev , Valentin F. V. F. Polyanin , Andrei D. A. D. ( 2002 ). Handbook of Exact Solutions for Ordinary Differential Equations , 2 ed. CRC Press . bbook

    2002

Pith tools

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