Statistical Validation of Computer Models: Global and Subdomain Hypothesis Testing
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: We're looking at the paper: "Statistical Validation of Computer Models".
Title and authors: Tom: Moving past just introducing the FMMT, let’s look at what this paper actually summarizes regarding its main contribution. It’s about moving validation from general aggregate error checks to a much more specific functional comparison approach.
Jane: Right. They start by defining the fundamental problem as a hypothesis test: is the computer model output equal to the true physical response function everywhere in the input space, or is it not equal somewhere? That’s their global validation.
Lu: And then they immediately add subdomain validation on top of that, partitioning that whole input space into N disjoint subdomains. They then formulate a separate null hypothesis for each subdomain: is the model output equal to the true physical process within this specific subregion?
Meng: So instead of getting one big pass/fail result for the whole model, you get N different results, which is more informative if your application has spatially varying behavior.
Lalam: They summarize their methodology by using kernel ridge regression to estimate the discrepancy between the computer model and the physical process, then transforming those estimates into test statistics using generalized Fourier coefficients. It’s a two-step process: estimation followed by frequency-domain testing.
Tom: That sounds like they are leveraging spectral analysis to find discrepancies that might not show up in simpler tests based only on the function's overall shape. Is that what they’re doing?
Jane: Essentially, yes. They are using the Fourier domain to see if there are any systematic deviations from zero, which points towards a structural difference between the model and reality across those defined subregions.
Lu: The theoretical justification for this is strong because they prove the asymptotic normality of those generalized Fourier coefficients under specific conditions, which gives them a clear mathematical foundation for deriving p-values that work reliably.
Meng: But I’m still curious about how they handle the practical implementation details like choosing those regularization parameters or dealing with the noise variance estimation when we move this out of a controlled simulation environment and into something that might have more messy real-world inputs.
Lalam: They address that by using cross-validation to select those smoothing parameters, lambda n, based on cross-validation results for the kernel ridge regression estimator. This makes the estimation process more robust before they even get to the final test statistics.
Tom: So, it’s not just about having a theoretical result; it’s about making sure the underlying estimation of that discrepancy is sound and stable before you run your hypothesis tests on top of it.
The paper's summary: Jane: So we know they have the framework, now what are the specific improvements they propose to make this method better than what was already out there? They aren't just adding a new test statistic, right?
Tom: They’re suggesting incorporating uncertainty quantification directly into the validation process to estimate noise variance using effective degrees of freedom, which is a big step up from just guessing the noise level.
Lu: That estimation of noise variance via effective degrees of freedom means they can get a more accurate measure of the error, giving them better confidence in their results.
Meng: That’s good because it directly relates to how complex the model is, and if your model is really complicated, you need to account for that complexity in your error bars.
Lalam: Also, they formally incorporate calibration parameters into the validation process by stating that since those parameters are estimated at a rate of square root n, their plug-in error in the final result is asymptotically negligible compared to the nonparametric kernel ridge regression estimation error.
Tom: So they are basically saying that while those calibration details are important for fitting, you don't need to worry about them throwing off the main validation statistic if you use a proper estimator.
Jane: That’s right; they are essentially separating the core validation problem from the nuisance of parameter estimation, which makes the framework much cleaner and more practical for engineers.
Lu: And they also suggest choosing those smoothing parameters lambda n based on cross-validation, using an isotropic Matérn kernel with that lambda value determined by cross-validation during training. This ensures the model is regularized in a principled way, rather than just picking a random number.
Meng: Having that principled regularization helps when we deploy models because it prevents overfitting to the noise in your specific training data, which is something we’ve seen happen often at scale.
Tom: So they're tightening up the engineering side by making sure the estimation steps are principled—using cross-validation for lambda n and noise variance estimation based on effective degrees of freedom. That makes this method feel much more ready for actual use than just a theoretical exercise.
Jane: And that’s the essence of their improvements: they’re making the process rigorous enough to handle real-world complexities like noise, complexity, and parameter uncertainty in a structured way.
The paper's improvements: Tom: So we've gone through this paper on "Statistical Validation of Computer Models: Global and Subdomain Hypothesis Testing," covering the formal framework for global validation across the whole domain and the specific null hypotheses for subdomain testing, along with how they use Fourier maximum modulus tests derived from kernel ridge regression to get closed-form p-values.
Jane: The main implication is that model developers now have a structured way to check if their simulations are consistent with reality, not just aggregate error checks but targeted tests for specific regions of failure.
Lu: It’s a significant step forward because it provides a formal validation method that connects the theory of weak convergence to Gaussian processes, which gives us strong mathematical backing for the results.
Meng: For production, it means we can use these localized tests to focus our debugging on the specific regions where the model output deviates from physical reality.
Lalam: I’m fairly sure this method is going to be useful because of its computational efficiency and how it handles the noise estimation using effective degrees of freedom, which makes it a very practical validation tool.
Tom: The paper's title, "Statistical Validation of Computer Models: Global and Subdomain Hypothesis Testing," really captures the essence—it’s about testing both across the whole space and within specific subregions.
Jane: It’s a method that gives developers a concrete path to build more trustworthy computer models by ensuring they can identify exactly where those discrepancies are happening.
Lu: It moves us toward better model validation techniques for complex functions, which is what this research is aiming for with its focus on the function space itself.
Meng: We’re happy to see tools that help us debug our models efficiently rather than just spending hours chasing ghosts across massive datasets.
Lalam: And it provides a novel way to look at model validation, and we'll keep an eye on how this framework evolves in future work with two-sample function comparison problems.
Conclusion: Tom: So we’ve been talking about this paper, "Statistical Validation of Computer Models: Global and Subdomain Hypothesis Testing," which is basically about how to rigorously test if a computer model matches what the real physical process is doing, both everywhere and in specific spots.
Jane: Right. The core idea is that you can set up these hypothesis tests to see if there's any structural difference between the model output and the actual physics across the entire input domain or just within certain subregions you define.
Lu: The methodology they use is this Fourier maximum modulus test, which uses kernel ridge regression to estimate how much of a discrepancy there is and then builds statistics from generalized Fourier coefficients.
Meng: I’m interested in how practical that is. Is this something we can actually deploy without it taking forever to run? We need things that work at scale.
Lalam: It's computationally efficient, and the authors prove the test statistics are asymptotically normal, meaning we have a solid mathematical basis for the p-values they get.
Tom: That’s good because it’s not just some heuristic; it’s grounded in asymptotic theory. And they show that this method is much better at spotting local problems than older tests we've seen before on things like shear layer experiments.
Jane: And the application to the compressible shear layer experiment was really interesting, showing how this method could pinpoint exactly where the model was failing locally, not just giving you a general "it's wrong" answer for the whole simulation.
Lu: They also included some solid improvements, like using cross-validation to pick those smoothing parameters for the kernel ridge regression and estimating noise variance using effective degrees of freedom, which makes the error bars much more realistic.
Meng: That practical side matters a lot. If we can get better estimates on the noise variance and choose our regularization parameter correctly through cross-validation, then this framework might actually be something we can use to tune our models for production instead of just running it as a proof of concept.
Lalam: I’m confident in their answer; the paper does exactly what it says, and they show that this approach is mathematically sound for comparing functions.
Tom: So, to wrap up, this paper shows how to move model validation beyond simple checks by giving us a way to test global structure and local behavior using Fourier analysis and kernel ridge regression.
Jane: It’s about getting concrete evidence of where a computer model fails compared to the physical process, both on a large scale and in specific areas you choose.
Lu: The framework itself is useful for any problem where you need to compare two functions over a continuous domain, giving us that infinite-dimensional test statistic we needed.
Meng: It gives us better tools for debugging because it tells us *where* the model breaks, not just *that* it breaks somewhere.
Lalam: The paper "Statistical Validation of Computer Models: Global and Subdomain Hypothesis Testing" provides a novel way to handle function comparison problems with strong theoretical justification.
Tom: We’re definitely keeping an eye on this work because getting those practical improvements for noise estimation and regularization is exactly what we need to move this from theory into something we can actually use in the field.
Jane: Next up, we’ll be looking at some papers on how AI is handling coding and computation bottlenecks, so stay tuned.
Texas A&M University
stat.ME
Submitted: 2026-04-18
Updated: 2026-11-17
Code: https://github.com/ChaoanLi/FMMT
Importance score: 89/100
The gist: Computer simulations play an important role in scientific discovery and engineering innovation Reliable computer models enable virtual experimentation that reduces the need for costly and…
Key concepts
- Global Validation Hypothesis (H0)
- This tests if the computer model's function perfectly matches the physical process across its entire input domain. If H0 is true, there is no structural difference between the model and reality anywhere, meaning they are identical functions.
- Subdomain Validation Hypothesis (H0i)
- This extends global testing by checking specific subregions of the input domain. It tests if the model matches the physical process only within a chosen subregion. This helps identify local failures where the model performs poorly even if it looks good elsewhere.
- Fourier Maximum Modulus Test (FMMT)
- This is the proposed test statistic that measures discrepancy by analyzing generalized Fourier coefficients of a weighted estimate of the difference between the model and physical process. It uses Kernel Ridge Regression to estimate this discrepancy, leading to p-values based on asymptotic normality.
- Kernel Ridge Regression (KRR)
- KRR is a nonparametric regression technique used here to reconstruct the unknown function from data. It finds an estimated function that minimizes a combination of fitting the observed data points and keeping the resulting function smooth, which helps in estimating discrepancies.
Terminology
Summary
Computer simulations play an important role in scientific discovery and engineering innovation Reliable computer models enable virtual experimentation that reduces the need for costly and time-consuming physical testing. p. 0 This paper develops a formal frequentist framework for both global and subdomain validation of computer models. p. 0
Problem Formulation
The work formulates the null hypothesis as a functional statement, which is the computer model exhibits no statistically detectable structural discrepancy from the physical process over the entire input domain—going beyond conventional tests on finite-dimensional output vectors. Additionally, it introduces subdomain validation on user-specified subregions to identify deficiencies where a model may perform adequately globally while failing locally. p. 1 The global validation is formulated as H0: f(x) = y s(x) for all x ∈ omega ↔ H1: f(x) ≠ y s(x) for some x ∈ omega. p. 2 Subdomain validation aims at identifying the subregions where the computer response and the physical process differ, formulated as H0i: f(x) = y s(x) for all x ∈ omegai ↔ H1i: f(x) ≠ y s(x) for some x ∈ omegai. p. 2
Proposed Methodology
The proposed method is the Fourier maximum modulus test (FMMT), which uses Kernel Ridge Regression (KRR) to estimate the discrepancy, constructs test statistics from generalized Fourier coefficients of the weighted estimated discrepancy, and derives p-values from their joint asymptotic normality. The nonparametric regression step involves using KRR to reconstruct f as ˆfn:= argmin v∈H 1 n Xn i=1 (yi − v(xi))2 + λn∥v∥2 H. p. 3 For global validation, the test statistic is T:= max i≥1 √nρiˆs(i)n σˆn = √n σˆ n max i≥1 ρi Zomega (ˆfn − y s)(x) q p̂ n(x)hi(x)dx. p. 3 Subdomain testing is handled similarly by defining Ti:= √n σˆ n max j≥1 ρjˆs(j)n σˆn = √n σˆ n max j≥1 ρj Zomega (ˆfn − y s)(x) q p̂ n(x)hij(x)dx. p. 4
Theoretical Justifications
Theorem 4.1 establishes the asymptotic normality of weighted generalized Fourier coefficients of KRR, stating that the infinite-dimensional vector (√nρ i(sˆ n(i) − s(i)) n) converges weakly to a normal distribution with mean zero and covariance matrix diag(ρ 2 i σ 2) i. p. 5 The test statistic T is derived from this result, where the p-value under H0 is 1 − F(T), and under H1, T grows at the rate OP(n(1/2)) implying consistency. p. 4 The proof relies on showing that Zn(g) converges weakly to a Gaussian process Z, which is achieved by verifying conditions B1 (Total boundedness), B2 (Asymptotic equicontinuity), and B3 (Convergence of finite-dimensional distributions). p. 5
Simulation Studies
Empirical performance is assessed through Monte Carlo studies comparing FMMT with Neumeyer & Dette (2003) and Eubank & Hart (1992) tests. The results show that for sine-type alternatives, EH achieves perfect power (1. p. 7000 throughout), while FMMT is nearly perfect (≥ 0. p. 7976). In the shear layer experiment, FMMT strongly rejects H0 globally and demonstrates superior sensitivity to localized differences compared to the Neumeyer–Dette procedure. p. 0
Application to Shear Layer Experiment
The FMMT was applied to the compressible shear layer, confirming global discrepancies and dissecting them with subdomain resolution. Subdomain analysis revealed that FMMT rejected H0 in Subdomain 3 (Mc ∈ [0. p. 55, 0.75]), a novel finding attributable to its sensitivity to sinusoidal fluctuations. p. 8 The results confirm FMMT's capacity to confirm global differences and dissect them with subdomain resolution, providing insights beyond competing methods.
Conclusion
This work introduces a novel hypothesis testing methodology based on generalized Fourier coefficients for validating computer models globally and locally. The proposed test is computationally efficient and theoretically justified for both global and subdomain hypotheses. p. 9 The framework can also be adapted to two-sample function comparison problems which will be explored in future work. p. 6
Data and Code Availability Statement
All code to reproduce the simulation studies and case study results is publicly available at https://github.com/ChaoanLi/FMMT. p. 0
References
Balci, O. & Sargent, R. p. 1 G. (1982), ‘Validation of multivariate response models using hotelling’s two-sample T2 test’, Simulation 39(6), 185–192. p. 1
Boente, G. & Pardo-Fernández, J. p. 2 p. 2 p. 2 C. (2024), ‘Robust tests for equality of regression curves based on characteristic functions’, Statistics 58(4), 892–917. p. 2
Duong, T. (2013), ‘Local significant differences from nonparametric two-sample tests’, Journal of Nonparametric Statistics 25(3), 635–645. p. 6
Eubank, R. L. & Hart, J. D. (1992), ‘Testing goodness-of-fit in regression via order selection criteria’, The Annals of Statistics 20(3), 1412–1425. p. 6
González-Manteiga, W. p. 2 & Crujeiras, R. p. 2 M. (2013), ‘An updated review of goodness-of-fit tests for regression models’, Test 22(3), 361–411. p. 2
Gramacy, R. p. 1 B. (2020), Surrogates: Gaussian Process Modeling, Design, and Optimization for the Applied Sciences, Chapman and Hall/CRC. p. 2
Hall, P. & Hart, J. D. (1990), ‘Bootstrap test for difference between means in nonparametric regression’, Journal of the American Statistical Association 85(412), 1039–1049. p. 4
Härdle, W. p. 2 & Marron, J. p. 2 S. (1990), ‘Semiparametric comparison of regression curves’, The Annals of Statistics 18(1), 63–89. p. 6
Hills, R. G. (2006), ‘Model validation: model parameter and measurement uncertainty’, Journal of Heat Transfer 128(4), 339–351. p. 4
Hills, R. G. & Trucano, T. p. 1 p. 1 p. 1 G. (1999), ‘Statistical validation of engineering and scientific models: Background’, Sandia National Laboratories, SAND99-1256. p. 0
Hills, R. G. & Trucano, T. G. (2002), ‘Statistical validation of engineering and scientific models: a maximum likelihood based metric’, Sandia National Laboratories, SAND2001-1783. p. 1
Hochberg, Y. p. 4 & Tamhane, A. p. 4 C. (1987), Multiple comparison procedures, John Wiley & Sons, Inc.
Jin, S., Tuo, R., Tiwari, A., Bukkapatnam, S., Aracne-Ruddle, C., Lighty, A., Hamza, H. & Ding, Y. (2023), ‘Hypothesis tests with functional data for surface quality change detection in surface finishing processes’, IISE Transactions 55(9), 940–956. p. 2
Jones, M. C. (1993), ‘Simple boundary correction for kernel density estimation’, Statistics and Computing 3(3), 135–146. p. 4
Kennedy, M. p. 1 p. 1 C. & O’Hagan, A. p. 1 p. 1 (2000), ‘Predicting the output from a complex computer code when fast approximations are available’, Biometrika 87(1), 1–13. p. 1
Kennedy, M. C. & O’Hagan, A. (2001), ‘Bayesian calibration of computer models’, Journal of the Royal Statistical Society: Series B (Statistical Methodology) 63(3), 425–464. p. 0
Kim, I., Lee, A. B. & Lei, J. (2019), ‘Global and local two-sample tests via regression’, Electronic Journal of Statistics 13(2), 5253 – 5305. p. 2
King, E., Hart, J. D. & Wehrly, T. E. (1991), ‘Testing the equality of two regression curves using linear smoothers’, Statistics & Probability Letters 12(3), 239–247. p. 2
Kulasekera, K. p. 2 (1995), ‘Comparison of regression curves using quasi-residuals’, Journal of the American Statistical Association 90(431), 1085–1093.
Loftsgaarden, D. p. 4 O. & Quesenberry, C. p. 4 P. (1965), ‘A nonparametric estimate of a multivariate density function’, The Annals of Mathematical Statistics 36(3), 1049–1051. p. 4
Mammen, E. & van de Geer, S. p. 5 p. 5 (1997), ‘Penalized quasi-likelihood estimation in partial linear models’, The Annals of Statistics 25(3), 1014–1035. p. 0
Neumeyer, N. p. 2 & Dette, H. p. 2 (2003), ‘Nonparametric comparison of regression curves: an empirical process approach’, The Annals of Statistics 31(3), 880–920. p. 6
Oberkampf, W. p. 1 p. 1 p. 1 L. (1994), A proposed framework for computational fluid dynamics code calibration/validation, in ‘25th Plasmadynamics and Lasers Conference’, p. p. 1 2540.
Oberkampf, W. L. & Barone, M. p. 1 F. (2006), ‘Measures of agreement between computation and experiment: validation metrics’, Journal of Computational Physics 217(1), 5–36. p. 1
Oberkampf, W. L. & Trucano, T. G. (2002), ‘Verification and validation in computational fluid dynamics’, Progress in Aerospace Sciences 38(3), 209–272. p. 1
Pardo-Fernández, J. C., Jiménez-Gamero, M. D. & Ghouch, A. E. (2015), ‘A non-parametric anova-type test for regression curves based on characteristic functions’, Scandinavian Journal of Statistics 42(1), 197–213.
Pardo-Fernández, J. C., Van Keilegom, I. p. 5 & González-Manteiga, W. p. 2 (2007), ‘Testing for the equality of k regression curves’, Statistica Sinica 17(3), 1115–1137. p. 2
Parzen, E. (1962), ‘On estimation of a probability density function and mode’, The Annals of Mathematical Statistics 33(3), 1065–1076. p. 6
Prakash, A. p. 2, Tuo, R. & Ding, Y. (2022), ‘Gaussian process-aided function comparison using noisy scattered data’, Technometrics 64(1), 92–102. p. 2
Rasmussen, C. p. 3 E. & Williams, K. p. 3 I. (2006), Gaussian Processes for Machine Learning, MIT Press. p. 1
Rice, J. (1984), ‘Bandwidth choice for nonparametric regression’, The Annals of Statistics 12(4), 1215–1230. p. 4
Sacks, J., Schiller, S. B. & Welch, W. J. (1989), ‘Designs for computer experiments’, Technometrics 31(1), 41–47. p. 0
Santner, T. p. 1 J., Williams, B. p. 3 J. & Notz, W. I., The Design and Analysis of Computer Experiments, Springer. p. 0
Schölkopf, B. p. 3, Herbrich, R. & Smola, A. J., A generalized representer theorem, in ‘International Conference on Computational Learning Theory’, Springer, pp. p. 3 416–426.
Silverman, B. p. 4 W. (2018), Density estimation for statistics and data analysis, Routledge. p. 4
Stein, M. L., Interpolation of Spatial Data: Some Theory for Kriging, Spring. p. 0
Tuo, R., Wang, Y. & Jeff Wu, C. (2020), ‘On the improved rates of convergence for Matérn-type kernel ridge regression with application to calibration of computer models’, SIAM/ASA Journal on Uncertainty Quantification 8(4), 1522–1547. p. 0
Tuo, R. & Wu, C. F. J., ‘Efficient calibration for imperfect computer models’, The Annals of Statistics 43(6), 2331–2352. p. 0
Tuo, R. & Zou, L., ‘Asymptotic theory for linear functionals of kernel ridge regression’, Statistica Sinica. p. 0 accepted.
van de Geer, S. A., Empirical Processes in M-estimation, Vol. p. 1 6, Cambridge Univ. Press.
van der Vaart, A. p. 5 p. 5 W., Asymptotic Statistics, Vol. p. 1 3, Cambridge Univ. Press.
van der Vaart, A. W. & Wellner, J. p. 5, Weak Convergence and Empirical Processes: with Applications to Statistics, Springer.
Wahba, G., Spline Models for Observational Data, Vol. p. 0 59, SIAM.
Wang, S., Chen, W. & Tsui, K.-L., ‘Bayesian validation of computer models’, Technometrics 51(4), 439–451. p. 0
Wang, Y. & Tuo, R., ‘Semi-parametric adjustment to computer models’, Statistics 54(6), 1255–1275. p. 0
Supplementary Material
A general weak convergence theorem is provided in the Supplementary Appendix, including a proof of Theorem 4.1. The proof involves showing that Zn(g) converges weakly to a Gaussian process GP(0, Ψ), and the final step uses the continuous mapping theorem to obtain the desired result. p. 4
A general weak convergence theorem
The proof of Theorem 4.1 relies on the following result on the weak convergence of stochastic processes defined over a set of functions G ⊂ L2(omega): Zn(g):= √n Zomega (ˆfn − f)(x)g(x)dx, g ∈ G.
Theorem A.1
Under Conditions C1–C4, as n → ∞, the infinite-dimensional vector (√nρ i(sˆ n(i) − sˆ n(i)) n) converges weakly to a normal distribution with mean zero and covariance matrix diag(ρ 2 i σ 2) i.
B Proof of Theorem 4. p. 11
The proof of Theorem 4.1 relies on the following result on the weak convergence of stochastic processes defined over a set of functions G ⊂ L2(omega): Zn(g):= √n Zomega (ˆfn − f)(x)g(x)dx, g ∈ G.
B.1 Asymptotic equicontinuity
The proof of Condition B2 involves partitioning Zn into a bias term and a variance term, Bn(g) and Vn(g), respectively. The proof of eq. (12) shows that Vn(g) is a sub-Gaussian process with respect to the semi-norm dVn(g1, g2):= ςCη/2∥g1 − g2∥L2. p. 5
B.3 Convergence of finite-dimensional distributions
The proof of Theorem A.1 concludes by showing that the infinite-dimensional vector converges weakly to a zero-mean Gaussian process Z = (Z i,. p. 5..). This convergence is established using the continuous mapping theorem after establishing asymptotic equicontinuity and convergence of finite-dimensional distributions. p. 4
Lemma B.1
Suppose Conditions C1–C4 are fulfilled, and G ⊂ pH satisfies eq. (9). Then we have Zn L−→ GP(0, Ψ), in L∞(G), with Ψ(g1, g2) = σ squared Romega g1(x)g2(x)/p(x)dx <ref:2604. p. 0
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Develop a formal hypothesis testing framework for computer models that allows for checking structural discrepancies globally across an entire input domain and locally within user-specified subregions. This enables targeted model refinement by identifying specific areas of failure, as noted in Section 2:
a model may perform adequately globally while failing locally.
-
Implement the Fourier Maximum Modulus Test (FMMT) as a computationally efficient validation tool. FMMT leverages kernel ridge regression to estimate discrepancy and constructs test statistics from generalized Fourier coefficients, providing closed-form p-values based on the asymptotic normality established in Theorem 4.1.
-
Integrate uncertainty quantification directly into model validation by estimating noise variance using effective degrees of freedom as suggested in Section 3.3:
The noise variance sigma squared is estimated by sigma squared n, which accounts for the model’s complexity using the effective degrees of freedom (d.f.)
. This allows for more robust error estimation than traditional methods. -
Enhance model calibration procedures by formally incorporating calibration parameters into the validation process, ensuring that results remain valid even when using calibrated estimators:
Since calibration occurs at the parametric sqrt n rate, the plug-in error is asymptotically negligible relative to the nonparametric KRR estimation error
. -
Perform rigorous cross-validation for hyperparameter selection during model training by choosing smoothing parameters lambda n based on cross-validation, as detailed in Section 3.3:
The KRR estimator for f utilizes the isotropic Matérn kernel with the regularization parameter lambda n chosen by cross-validation.
Sources
Related papers
- Learning Robust Treatment Rules for Censored Data
- Neural Estimation of Summary Statistics for Simulation-Based Inference with Non-Asymptotic Guarantees
- Spectral divide-and-conquer MCMC for long stationary time series
- Improving the Efficiency of Subgroup Analysis in Randomized Controlled Trials with TMLE
- Personalized Federated Vector Autoregression with Personalization Diversity
- Doubly Robust and Efficient Calibration of Prediction Sets for Right-Censored Time-to-Event Outcomes