Efficient Gaussian Process Modeling for Large Replicated and Censored Data in Industrial Research
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: We're looking at the paper: "Efficient Gaussian Process Modeling for Large Replicated and Censored Data in Industrial Research".
Jane: Here's the gist of the paper. Gaussian process regression is widely used for modeling responses in both physical and computer experiments, but standard Gaussian process inference faces scalability challenges with large replicated and censored datasets The proposed method develops a Gaussian process modeling framework that efficiently analyzes large replicated and censored data by integrating a Vecchia approximation with a likelihood-based formulation that fully exploits replication and rigorously incorporates information from censored observations Modeling the Data Structure The framework models the response as Yij = W(xi) + epsilonij, where W(xi) is the latent function following a Gaussian process with zero mean and covariance kernel k The total response vector Y is stacked as (y, y∗)⊤ and follows a multivariate normal distribution N µ, Σ where Σ = AK(X, X)A⊤ + σ2IN Latent censored responses are introduced as y∗ij satisfying the constraint y∗ij ≥ Ci, representing the unobserved true response underlying the censoring event Scalability through Approximation To address computational cost, a Vecchia approximation is applied to replace the exact chain-rule factorization of the observed-data likelihood p(y, u θ) with a product of lower-dimensional conditional distributions This approximation keeps each local conditional density based on directly observed responses while allowing prediction neighborhoods to include both observed and censored responses The complexity for the uncensored likelihood contribution is O(nk3) over n unique input locations, where k is the number of nearest neighbors Handling Censored Likelihood The censored likelihood contribution at location i is written as p(yi, ui yN(i); θ) = p(yi yN(i); θ) Pr y∗i ≥ Ci yN(i), yi; θ This requires evaluating a correlated multivariate normal tail probability, which is addressed using the separation of variables (SOV) estimator or the minimax exponential tilting (MET) method The MET method improves upon SOV by using an importance sampling approach with an exponentially tilted proposal to estimate the censored probability Prediction and Inference Prediction at a new input location x∗ is conditioned on a local neighborhood N(∗) of size k, ensuring sufficient directly observed responses are available for conditioning The predictive mean and variance under censoring are given by formulas (7) and (8), which depend on the conditional mean mc and variance Vc of the latent censored block Prediction intervals are constructed using a two-stage composition sampling procedure, where the latent censored responses are sampled from their truncated conditional distribution, followed by sampling the new response Performance and Robustness Simulation studies show that explicitly modeling censoring through likelihood-based methods like MC-SOV-Vecchia and MET-Vecchia substantially improves point prediction and upper-tail classification relative to naive approaches In a real data application, these methods achieve MSPE values of 2.22 and 2.34, with the highest percentages of predicted values above the censoring threshold compared to baseline models The framework remains stable under highly unbalanced replication and larger noise variance, suggesting its applicability to more realistic industrial data structures Future Directions The current framework can be extended to handle interval censoring where responses are known only to lie within an interval
CL, CU: Furthermore, the framework can be combined with models for multivariate outputs and dimension reduction techniques for high-dimensional inputs or outputs Future research may also explore its use within sequential experimental design where accurate uncertainty quantification under incomplete observations is critical References Micka¨el Binois, Robert B Gramacy, and Mike Ludkovski.
Tom: Practical heteroscedastic gaussian process modeling for large simulation experiments.
Jane: Journal of Computational and Graphical Statistics, 27(4):808–821, 2018 Zdravko I Botev.
Tom: The normal law under linear restrictions: simulation and estimation via minimax tilting.
Paper summary: Tom: So, we’re talking about this paper today, "Efficient Gaussian Process Modeling for Large Replicated and Censored Data in Industrial Research". It looks at the headache that happens when you have repeated measurements combined with incomplete data in Gaussian process regression.
Jane: That sounds like a really tough problem because standard methods just get completely bogged down when the datasets get big, especially when you add replication and censoring together.
Lu: Exactly. The core idea here is they develop a framework that uses a Vecchia approximation for speed while using a likelihood-based setup that actually accounts for both the repeated data and those censored observations rigorously <ref:2611.05684#pg1>.
Meng: So, what does this mean in practice? It’s tackling the scalability issue that makes standard Gaussian process inference too slow for large, real-world industrial experiments. I need to know if this actually keeps up when we run models on massive data streams <ref:2611.05684#pg2>.
Tom: The paper claims they integrate that Vecchia approximation with a likelihood formulation that fully exploits replication and incorporates censored information, which is similar to what you’d get from exactly simulating truncated distributions <ref:2611.05684#pg1>. They are trying to make the math doable while keeping the accuracy high.
Jane: I think that means they’re building a system where we can handle those large replicated and censored datasets without it becoming computationally impossible for us to run inferences <ref:2611.05684#pg2>. It focuses on how to model the response as a latent function plus some noise, like y equals W of x plus epsilon, where W is that Gaussian process <ref:2611.05684#pg3>.
Lu: Right. They set up the data structure by stacking the response vector as y and y star, where those censored responses are defined by an inequality, like y star greater than or equal to C <ref:2611.05684#pg2>. That’s how they rigorously incorporate that information from the censoring events.
Meng: Okay, but the computational cost of using those exact likelihoods is usually way too high for what we’re dealing with at scale <ref:2611.05684#pg3>. How do you fix that cost issue?
Tom: They use a Vecchia approximation to replace the exact chain-rule factorization of the observed data likelihood with a product of lower-dimensional conditional distributions <ref:2611.05684#pg2>. This keeps each local conditional density based only on directly observed responses, which helps keep things manageable.
Paper summary: Jane: That sounds like they are keeping the local calculations simple using only what we actually see, but they still allow the prediction neighborhoods to include both those observed and censored responses <ref:2611.05684#pg2>. But then there’s the censoring part itself, right?
Lu: That’s where it gets tricky. The censored likelihood at a location i is written as a conditional probability that requires evaluating a correlated multivariate normal tail probability <ref:2611.05684#pg2>. They address this using techniques like the separation of variables estimator or the minimax exponential tilting method, MET <ref:2611.05684#pg3>.
Meng: What does that mean for me in terms of deployment? Is this MET method just computationally expensive, or is it a real win for getting accurate predictions on production data?
Tom: The paper shows that explicitly modeling the censoring through these likelihood-based methods—like MC-SOV and MET—substantially improves point prediction and upper-tail classification compared to simpler approaches <ref:2611.05684#pg3>. They report MSPE values of two point two two and two point three four in a real data application, with the highest percentages of predicted values above the censoring threshold compared to baseline models <ref:2611.05684#pg3>.
Jane: So, for someone just driving or cooking who needs a reliable prediction under uncertainty, this suggests that handling that censoring properly actually gives you better performance than just ignoring it or using a naive fixed-at-C strategy <ref:2611.05684#pg3>. It’s about getting those predictions above the threshold more accurately.
Lu: And they also showed robustness, even when dealing with highly unbalanced replication and larger noise variance <ref:2611.05684#pg3>. This suggests the framework isn't just for clean, perfectly balanced data; it holds up in more realistic industrial scenarios <ref:2611.05684#pg3>.
Meng: I'm concerned about the practical deployment cost of these likelihood-based methods. What is the overhead compared to a simpler method that might be faster for a real-time system?
Tom: The complexity for the uncensored likelihood contribution is O of n k cubed, where k is the number of nearest neighbors <ref:2611.05684#pg2>. That’s what they use to keep the cost in check for that part of the calculation.
Jane: So, even with that complexity, it seems like a necessary trade-off to get those better prediction results when you have censored data <ref:2611.05684#pg3>. What about what they can’t do?
Paper summary: Lu: The paper does mention future work where they can extend this framework to handle interval censoring, meaning responses are only known to be within a range, like between a lower bound and an upper bound <ref:2611.05684#pg3>. They could also combine it with models for multi-output or dimension reduction techniques for high-dimensional inputs <ref:2611.05684#pg3>.
Meng: So, the current limitation is that it’s focused on point censoring, but the ambition is to make the model more general and flexible enough for more complex real-world data structures <ref:2611.05684#pg3>. I wonder how hard it would be to implement those extensions at scale.
Tom: The immediate implication is that we have a way to model large replicated and censored data efficiently using these specific techniques, which is what the paper "Efficient Gaussian Process Modeling for Large Replicated and Censored Data in Industrial Research" proposes <ref:2611.05684#pg1>.
Jane: When we look at the title and authors, we see Emily Kang and Shuo Li from the University of Cincinnati working on this for a real industrial application at Procter and Gamble <ref:2611.05684#pg1>. That context tells us exactly where these methods are being tested.
Lu: It connects directly to the existing work, like Groot and Lucas's two thousand twelve paper using Tobit likelihoods and expectation propagation, showing how this new approach tries to handle those high-dimensional multivariate normal densities more tractably than what was possible before <ref:2611.05684#pg3>.
Meng: It’s interesting that they are pushing the boundary on the computational side by using Vecchia approximation alongside a likelihood formulation rather than just relying on variational inference, which we saw used in earlier work <ref:2611.05684#pg3>.
Tom: The paper shows that explicitly accounting for censoring through these likelihood-based methods improves upper-tail prediction and uncertainty calibration relative to common non-censoring aware strategies <ref:2611.05684#pg3>. That is the main empirical win they report.
Jane: So, what this means for the world, or at least for our day-to-day modeling, is that if you’re dealing with large experiments where measurements are repeated and sometimes missing data points are censored, you have a proven way to model that uncertainty without letting the computation explode <ref:2611.05684#pg1>.
Lu: It moves the goal of joint modeling replicated and censored data from a theoretical challenge into a practically feasible one for industrial settings <ref:2611.05684#pg2>. The framework essentially provides a blueprint for how to combine approximation with likelihood methods successfully.
Paper summary: Meng: If we can deploy this, it means we can get more reliable predictions in areas like quality control or environmental monitoring where data is often messy and incomplete <ref:2611.05684#pg2>. It's about moving past models that assume perfect observation.
Tom: The authors are really emphasizing the integration of Vecchia approximation for scalability with a likelihood formulation for rigor, which is a specific combination that seems to be key to their efficiency <ref:2611.05684#pg2>.
Jane: So, the title and authors point to this being highly practical research, not just abstract theory <ref:2611.05684#pg1>. It’s about taking Gaussian process modeling and making it work for the messy reality of physical experiments <ref:2611.05684#pg2>.
Lu: The paper sets a clear direction for future research by pointing toward interval censoring and combining it with other advanced techniques, like multivariate outputs or dimension reduction <ref:2611.05684#pg3>. That gives us a roadmap for where the next set of papers might go.
Meng: It’s good to see that they aren't just stopping at point censoring; they are thinking about how to make the model more general <ref:2611.05684#pg3>. That’s important for building robust, production-ready AI systems that need to handle real data noise.
Tom: The paper demonstrates a methodology that handles the complexity of replication and censoring by carefully constructing the likelihood contribution at each location <ref:2611.05684#pg2>. It shows how to use techniques like MET to properly estimate those censored probabilities <ref:2611.05684#pg3>.
Jane: So, the main thing we need to remember is that this framework is designed specifically for the joint modeling of replicated and censored data in a way that scales well <ref:2611.05684#pg2>. It’s about making the difficult problem computationally tractable <ref:2611.05684#pg3>.
Lu: The overall message is that we can get better, more robust predictions from Gaussian processes even when the data is large and has these specific real-world complexities <ref:2611.05684#pg2>. It’s a concrete step toward applying these tools in industrial research settings <ref:2611.05684#pg3>.
Meng: For deployment, the caveat is that you still have to deal with the cost associated with those likelihood evaluations, even if they are approximated <ref:2611.05684#pg2>. We need to see if those approximations translate into low operational costs on real traffic <ref:2611.05684#pg3>.
Tom: The paper shows that when you use these specific likelihood-based methods, you get superior performance in prediction and uncertainty calibration compared to simpler models <
Conclusion: Tom: So, to wrap up this look at the paper "Efficient Gaussian Process Modeling for Large Replicated and Censored Data in Industrial Research" we’re talking about Emily Kang and Shuo Li from the University of Cincinnati.
Jane: It really boils down to taking a model that usually gets too slow when the dataset grows huge or has missing pieces, and making it actually work in the real world.
Tom: They built this framework using a Vecchia approximation combined with a likelihood-based approach to handle both repeated measurements and those censored observations.
Jane: What that means is they found a way to keep things computationally manageable while still being rigorous about how those censored observations affect the model.
Tom: By explicitly modeling the censoring using methods like MET, you get much better predictions and a clearer picture of the uncertainty than just using simpler, naive methods.
Jane: It suggests that for industrial research where data is often messy and incomplete, you can actually get more accurate results without making the system run too slowly.
Tom: The real win they show is that this approach performs better than baseline models when it comes to predicting those upper tails of the distribution, which is often where you need the most reliable information.
Jane: It’s a concrete step toward using Gaussian process modeling for things like quality control or monitoring where you can trust your predictions more because you’re accounting for the data structure correctly.
Tom: But they also admit there are still future directions, like handling interval censoring and combining it with other techniques for high-dimensional inputs.
Jane: So the next thing we should look at is how those extensions actually work in practice and what kind of real-world constraints they might face when you try to push them further.
Ying Zhang, Emily L. Kang, Shuo Li
University of Cincinnati · Procter & Gamble Company
stat.AP
Submitted: 2026-11-03
Updated: 2026-11-03
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 81/100
The gist: Gaussian process regression is widely used for modeling responses in both physical and computer experiments…
Key concepts
- Gaussian Process Regression
- This is a statistical tool used to model functions where any output value is drawn from a Gaussian distribution. It's useful for predicting unknown values based on observed data, offering both a prediction (mean) and an uncertainty estimate (variance) for new inputs.
- Vecchia Approximation
- This approximation simplifies the complex calculation of the likelihood function by breaking it down into simpler, lower-dimensional conditional distributions. This makes the model computationally feasible when dealing with many data points, allowing it to handle large datasets more efficiently.
- Censored Likelihood
- This specifically handles data where some true responses are unknown but only have a lower bound (e.g., 'the true value is at least C'). The method uses advanced techniques like MET to estimate the probability of these censored observations correctly, improving prediction reliability.
- Minimax Exponential Tilting (MET)
- MET is an importance sampling technique used to calculate the probability of censored data points. It works by using a specially tilted proposal distribution to sample from the truncated normal distribution, ensuring accurate estimation even when dealing with complex censoring patterns.
Terminology
Summary
Gaussian process regression is widely used for modeling responses in both physical and computer experiments, but standard Gaussian process inference faces scalability challenges with large replicated and censored datasets The proposed method develops a Gaussian process modeling framework that efficiently analyzes large replicated and censored data by integrating a Vecchia approximation with a likelihood-based formulation that fully exploits replication and rigorously incorporates information from censored observations
Modeling the Data Structure
The framework models the response as Yij = W(xi) + epsilonij, where W(xi) is the latent function following a Gaussian process with zero mean and covariance kernel k The total response vector Y is stacked as (y, y∗)⊤ and follows a multivariate normal distribution N µ, Σ where Σ = AK(X, X)A⊤ + σ2IN Latent censored responses are introduced as y∗ij satisfying the constraint y∗ij ≥ Ci, representing the unobserved true response underlying the censoring event
Scalability through Approximation
To address computational cost, a Vecchia approximation is applied to replace the exact chain-rule factorization of the observed-data likelihood p(y, u θ) with a product of lower-dimensional conditional distributions This approximation keeps each local conditional density based on directly observed responses while allowing prediction neighborhoods to include both observed and censored responses The complexity for the uncensored likelihood contribution is O(nk3) over n unique input locations, where k is the number of nearest neighbors
Handling Censored Likelihood
The censored likelihood contribution at location i is written as p(yi, ui yN(i); θ) = p(yi yN(i); θ) Pr y∗i ≥ Ci yN(i), yi; θ This requires evaluating a correlated multivariate normal tail probability, which is addressed using the separation of variables (SOV) estimator or the minimax exponential tilting (MET) method The MET method improves upon SOV by using an importance sampling approach with an exponentially tilted proposal to estimate the censored probability
Prediction and Inference
Prediction at a new input location x∗ is conditioned on a local neighborhood N(∗) of size k, ensuring sufficient directly observed responses are available for conditioning The predictive mean and variance under censoring are given by formulas (7) and (8), which depend on the conditional mean mc and variance Vc of the latent censored block Prediction intervals are constructed using a two-stage composition sampling procedure, where the latent censored responses are sampled from their truncated conditional distribution, followed by sampling the new response
Performance and Robustness
Simulation studies show that explicitly modeling censoring through likelihood-based methods like MC-SOV-Vecchia and MET-Vecchia substantially improves point prediction and upper-tail classification relative to naive approaches In a real data application, these methods achieve MSPE values of 2.22 and 2.34, with the highest percentages of predicted values above the censoring threshold compared to baseline models The framework remains stable under highly unbalanced replication and larger noise variance, suggesting its applicability to more realistic industrial data structures
Future Directions
The current framework can be extended to handle interval censoring where responses are known only to lie within an interval [CL, CU] Furthermore, the framework can be combined with models for multivariate outputs and dimension reduction techniques for high-dimensional inputs or outputs Future research may also explore its use within sequential experimental design where accurate uncertainty quantification under incomplete observations is critical
References
Micka¨el Binois, Robert B Gramacy, and Mike Ludkovski. Practical heteroscedastic gaussian process modeling for large simulation experiments. p. 0 Journal of Computational and Graphical Statistics, 27(4):808–821, 2018
Zdravko I Botev. The normal law under linear restrictions: simulation and estimation via minimax tilting. p. 2 Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79(1):125–148, 2017
Fang Cao, Shan Ba, William A. Brenneman, and V. Roshan Joseph. Model calibration with censored data. p. 9 Technometrics, 60(2):255–262, 2018
Jian Cao and Matthias Katzfuss. Linear-cost vecchia approximation of multivariate normal proba35 Abilities. p. 2 Journal of the American Statistical Association, 2025
Reed A. Carnell. lhs: Latin Hypercube Samples, 2019
Jialei Chen, Simon Mak, V. Roshan Joseph, and Chuck Zhang. p. 0 Adaptive design for gaussian process regression under censoring. p. 2 The Annals of Applied Statistics, 16(2):744–764, June 2022
Tianqi Chen and Carlos Guestrin. Xgboost: A scalable tree boosting system. p. 1 In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 785–794, 2016
Andreas C. Damianou and Neil D. p. 1 Lawrence. Deep gaussian processes. p. 1 In Aad van der Vaart and Max Welling, editors, Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics (AISTATS), volume 31 of Proceedings of Machine Learning Research, pages 207–215. p. 0 PMLR, 2013
Abhirup Datta, Sudipto Banerjee, Andrew O Finley, and Alan E Gelfand. Hierarchical nearestneighbor gaussian process models for large geostatistical datasets. p. 1 Journal of the American Statistical Association, 111(514):800–812, 2016
J. Armando Dom´ınguez-Molina, Graciela Gonz´alez-Far´ıas, and Arjun K. Gupta. The multivariate closed skew normal distribution. p. 8 Technical report, Department of Mathematics and Statistics, Bowling Green State University, 2003
Daniela Gammelli, Kristian P. Rolsted, Dario Pacino, and Filipe Rodrigues. Generalized multioutput gaussian process censored regression. p. 2 Pattern Recognition, 129:108751, 2022
Daniele Gammelli, Inon Peled, Filipe Rodrigues, Dario Pacino, Haci A. Kurtaran, and Francisco C. Pereira. Estimating latent demand of shared mobility through censored gaussian processes. p. 1 Transportation Research Part C: Emerging Technologies, 120:102775, 2020
Alan Genz. Numerical computation of multivariate normal probabilities. p. 2 Journal of Computational and Graphical Statistics, 1(2):141–149, 1992
Alan Genz and Frank Bretz. Computation of Multivariate Normal and t Probabilities, volume 195 of Lecture Notes in Statistics. p. 2 Springer, Heidelberg, 2009
Graciela Gonz´alez-Far´ıas, J. Armando Dom´ınguez-Molina, and Arjun K. Gupta. Additive properties of skew normal random vectors. p. 1 Journal of Statistical Planning and Inference, 126(2): 521–534, 2004
Robert B Gramacy and Daniel W Apley. Local gaussian process approximation for large computer experiments. p. 6 Journal of Computational and Graphical Statistics, 24(2):561–578, 2015
Perry Groot and Peter Lucas. Gaussian process regression with censored data using expectation propagation. p. 2 In Proceedings of the 6th European Workshop on Probabilistic Graphical Models (PGM 2012), pages 115–122, 2012
Adam Gorm Hoffmann, Claus Thorn Ekstrøm, Benjamin Zeymer Christoffersen, and Andreas Kryger Jensen. Gaussian process regression for value-censored functional and longitudinal data. p. 2 Statistics in Medicine, 44(20–22):e70277, 2025
Andrea Karlova, Rishabh Kabra, Daniel Augusto de Souza, and Brooks Paige. Variational inference with censored gaussian process regressors. p. 2 In ICML Workshop on Structured Probabilistic Inference & Generative Modeling, 2024
Matthias Katzfuss and Joseph Guinness. A general framework for vecchia approximations of gaussian processes. p. 8 Statistical Science, 36(1):124–145, 2021
Parul V. Patil, Robert B. p. 3 Gramacy, Cayelan C. p. 1 Carey, and R. Quinn Thomas. Vecchiaapproximated bayesian heteroskedastic gaussian process models. p. 3 Technometrics, 2025
Michael JD Powell. A hybrid method for nonlinear equations. p. 9 Numerical Methods for Nonlinear Algebraic Equations, pages 87–114, 1970
Alexandra M. Schmidt and Alan E. p. 1 Gelfand. A bayesian coregionalization approach for multivariate pollutant data. p. 2 Journal of Geophysical Research: Atmospheres, 108(D24):8783, 2003
Adriano V. Vecchia. Estimation and model identification for continuous spatial processes. p. 3 Journal of the Royal Statistical Society: Series B (Methodological), 50(2):297–312, 1988
Steve Wilhelm and B. G. Manjunath. tmvtnorm: A package for the truncated multivariate normal distribution. p. 9 The R Journal, 7(1):23–37, 2015
A Derivation of Proposition 1 Step A.4: Predictive mean under censoring Starting from Step A. p. 83 and applying the law of total expectation, the predictive mean under censoring is E(ynew yo, yc ≥ C) = µnewo + Σnew,coΣ−1cco (mc − µco) which establishes (7)
B Computation of truncated moments To evaluate the predictive mean and variance in (7) and (8), we require the truncated moments mc = E(yc yo, yc ≥ C), Vc = Var(yc yo, yc ≥ C)
C Sampling from the predictive distribution To evaluate the predictive mean and variance in (7) and (8), we require the truncated moments mc = E(yc yo, yc ≥ C), Vc = Var(yc yo, yc ≥ C)
D Inverse-transform sampling in MC–SOV In the MC–SOV algorithm, each component zi,j is sampled sequentially from a standard normal distribution truncated below at αj (zi,1,..., zi,j−1)
E Minimax exponential tilting details The MET estimator of the censored probability is pbi = 1/M X M m=1 exp n ψi(z(m)i,λ∗i)o where ψi(z(m)i,λ∗i) = −z⊤ i λ∗ i + 1/2 λ∗ i squared + X di j=1 log [1 − Φ αj (z(m)i,1,..., z(m)i,j−1) − λ∗ i,j]
F Sensitivity to the maximum number of censored nearest neighbors This appendix reports a sensitivity analysis for the maximum number of censored nearest neighbors allowed in the prediction neighborhood
G Sensitivity analysis for unbalanced replication and larger noise variance To further assess the robustness of the proposed method, we conducted an additional one-dimensional sensitivity analysis under highly unbalanced replication and larger noise variance
H Table 7 Simulation settings for evaluating unbalanced repeated measurements and larger noise variance Scenario 3 uses the same unbalanced replication pattern as Scenario 2 but increases the noise variance from σ2 = 0.04 to σ2 = 0. p. 636
I Table 8 Prediction performance under balanced sparse replication, unbalanced replication, and larger noise variance in the one-dimensional example Scenario 3 MSPE MAE CRPS Coverage AIL
J Figure 4 provides a visual comparison of the fitted prediction curves, predictive intervals, and selected prediction locations under balanced replication, unbalanced replication, and increased noise variance
Summary
The proposed method provides robust performance across varying censoring levels and remains substantially closer to the oracle model than naive fixed-at-C and removed-censored strategies It explicitly accounting for censoring through likelihood-based methods improves upper-tail prediction and uncertainty calibration relative to common non-censoring-aware strategies The proposed MC-SOV-Vecchia and MET-Vecchia methods achieve the highest percentages of predicted values above the censoring threshold, 64.72% and 68.
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
-
Improved data modeling for industrial research by developing a framework that
simultaneously addresses replication structure, censoring, and computational scalability.
This allows AI systems to accurately model real-world experimental data containing both repeated measurements and detection limits without suffering from the cubic cost growth of standard Gaussian process inference. -
Enhanced predictive accuracy in complex datasets by integrating a likelihood-based formulation that
fully exploits replication and rigorously incorporates information from censored observations, analogous to exact simulation from truncated distributions.
This enables AI systems to make more reliable predictions for upper-tail responses where data is partially observed, outperforming methods that either fix censored values or remove them entirely. -
Robust uncertainty quantification by providing
reliable uncertainty quantification
through predictive moments derived from the latent distribution after conditioning on the censoring event. This allows AI systems to construct prediction intervals that are more appropriate for non-Gaussian distributions, which is crucial when dealing with complex experimental outcomes and manufacturing data. -
Scalable inference for large datasets by employing a Vecchia approximation framework that
decomposes the joint likelihood into a product of lower-dimensional conditional distributions.
This enables AI systems to perform inference onlarge replicated and censored data
where the computational cost remains tractable, unlike standard GP models whose cost grows cubically with observations. -
Improved extrapolation capability by incorporating information from censored neighbors during prediction, allowing the system to use
the event yc ≥ C
when predicting new inputs. This enables AI systems to make better predictions in the censored region by usinginformation from the censored neighbors while maintaining computational feasibility.
Sources
Related papers
- Unraveling time-varying causal effects of multiple exposures: integrating Functional Data Analysis with Multivariable Mendelian Randomization
- Strategic Causal Policy Learning with Manipulable Eligibility
- BayesJudge: Uncertainty-Aware Bayesian Meta-Evaluation of Human and LLM Judgments
- Automating structural reliability analysis with a multi-agent large language model framework
- Improving Minority Population Sampling with BISG Probabilities: Evidence from a Survey of Jewish Americans
- When Do Sports Leagues Stop Being Competitive? Bayesian Detection of Competitive-Balance Eras from Match-Level Data