arXiv subjects

Miroslav Vořechovský

Publications and source records attributed to Miroslav Vořechovský.

5 recordsLinked to original sources

arXiv2026

Uniform Maximum Projection Designs for Computer Experiments

Space-filling experimental designs are widely used in engineering computer experiments, where only a limited number of expensive model evaluations can be afforded. Distance-based designs such as Maximin or Minimax ensure global space-filling, while Latin hypercube sampling enforces uniform one-dimensional projections, yet neither guarantees uniformity in lowdimensional subspaces. Maximum Projection (MaxPro) designs were introduced to improve uniformity in low-dimensional subspaces, yet their original formulation relies on the Euclidean distance and may induce systematic density distortions in bounded domains. We demonstrate that the standard MaxPro criterion leads to statistically non-uniform sampling, resulting in undersampling of corner regions and biased Monte Carlo estimates. To remedy this issue, we introduce a periodic variant of the criterion, termed Uniform Maximum Projection (uMaxPro), in which the Euclidean metric is replaced by a periodic distance based on the minimum image convention. The proposed uMaxPro designs preserve the projection-aware structure of MaxPro while achieving statistical uniformity of the design-generation mechanism. Numerical experiments show unbiased Monte Carlo integration with reduced variance, excellent subspace projection performance, and competitive discrepancy properties. The methodology is further validated on benchmark engineering problems, including a meso-scale finite element model of concrete, demonstrating improved accuracy in surrogate modeling and probabilistic estimation. The resulting criterion provides a simple and computationally efficient modification of MaxPro that enhances its robustness for nonadaptive computer experiments. The construction algorithm, open-source implementation, and reproducible optimized designs are provided to facilitate practical adoption of the method.

cs.CE↗

arXiv2023

Failure Probability Estimation and Detection of Failure Surfaces via Adaptive Sequential Decomposition of the Design Domain

We propose an algorithm for an optimal adaptive selection of points from the design domain of input random variables that are needed for an accurate estimation of failure probability and the determination of the boundary between safe and failure domains. The method is particularly useful when each evaluation of the performance function g(x) is very expensive and the function can be characterized as either highly nonlinear, noisy, or even discrete-state (e.g., binary). In such cases, only a limited number of calls is feasible, and gradients of g(x) cannot be used. The input design domain is progressively segmented by expanding and adaptively refining mesh-like lock-free geometrical structure. The proposed triangulation-based approach effectively combines the features of simulation and approximation methods. The algorithm performs two independent tasks: (i) the estimation of probabilities through an ingenious combination of deterministic cubature rules and the application of the divergence theorem and (ii) the sequential extension of the experimental design with new points. The sequential selection of points from the design domain for future evaluation of g(x) is carried out through a new learning function, which maximizes instantaneous information gain in terms of the probability classification that corresponds to the local region. The extension may be halted at any time, e.g., when sufficiently accurate estimations are obtained. Due to the use of the exact geometric representation in the input domain, the algorithm is most effective for problems of a low dimension, not exceeding eight. The method can handle random vectors with correlated non-Gaussian marginals. The estimation accuracy can be improved by employing a smooth surrogate model. Finally, we define new factors of global sensitivity to failure based on the entire failure surface weighted by the density of the input random vector.

cs.CE↗

arXiv2023

Active Learning-based Domain Adaptive Localized Polynomial Chaos Expansion

The paper presents a novel methodology to build surrogate models of complicated functions by an active learning-based sequential decomposition of the input random space and construction of localized polynomial chaos expansions, referred to as domain adaptive localized polynomial chaos expansion (DAL-PCE). The approach utilizes sequential decomposition of the input random space into smaller sub-domains approximated by low-order polynomial expansions. This allows approximation of functions with strong nonlinearties, discontinuities, and/or singularities. Decomposition of the input random space and local approximations alleviates the Gibbs phenomenon for these types of problems and confines error to a very small vicinity near the non-linearity. The global behavior of the surrogate model is therefore significantly better than existing methods as shown in numerical examples. The whole process is driven by an active learning routine that uses the recently proposed $Θ$ criterion to assess local variance contributions. The proposed approach balances both \emph{exploitation} of the surrogate model and \emph{exploration} of the input random space and thus leads to efficient and accurate approximation of the original mathematical model. The numerical results show the superiority of the DAL-PCE in comparison to (i) a single global polynomial chaos expansion and (ii) the recently proposed stochastic spectral embedding (SSE) method developed as an accurate surrogate model and which is based on a similar domain decomposition process. This method represents general framework upon which further extensions and refinements can be based, and which can be combined with any technique for non-intrusive polynomial chaos expansion construction.

cs.LG↗

arXiv2022

Reliability analysis of discrete-state performance functions via adaptive sequential sampling with detection of failure surfaces

The paper presents a new efficient and robust method for rare event probability estimation for computational models of an engineering product or a process returning categorical information only, for example, either success or failure. For such models, most of the methods designed for the estimation of failure probability, which use the numerical value of the outcome to compute gradients or to estimate the proximity to the failure surface, cannot be applied. Even if the performance function provides more than just binary output, the state of the system may be a non-smooth or even a discontinuous function defined in the domain of continuous input variables. In these cases, the classical gradient-based methods usually fail. We propose a simple yet efficient algorithm, which performs a sequential adaptive selection of points from the input domain of random variables to extend and refine a simple distance-based surrogate model. Two different tasks can be accomplished at any stage of sequential sampling: (i) estimation of the failure probability, and (ii) selection of the best possible candidate for the subsequent model evaluation if further improvement is necessary. The proposed criterion for selecting the next point for model evaluation maximizes the expected probability classified by using the candidate. Therefore, the perfect balance between global exploration and local exploitation is maintained automatically. The method can estimate the probabilities of multiple failure types. Moreover, when the numerical value of model evaluation can be used to build a smooth surrogate, the algorithm can accommodate this information to increase the accuracy of the estimated probabilities. Lastly, we define a new simple yet general geometrical measure of the global sensitivity of the rare-event probability to individual variables, which is obtained as a by-product of the proposed algorithm.

cs.CE↗

arXiv2020

Fracture in random quasibrittle media: I. Discrete mesoscale simulations of load capacity and fracture process zone

Numerical simulations of concrete fracture performed with a probabilistic mesoscale discrete model are presented. The model represents a substantial part of material randomness by assigning random locations to the largest aggregates. The remaining part of randomness is introduced by causing material parameters to fluctuate randomly via a homogeneous random field. An extensive numerical study performed with the model considers prisms loaded in uniaxial tension with both fixed and rotating platens, and also beams with and without a notch loaded in three point bending. The results show the nontrivial effect of (i) autocorrelation length and (ii) variance of the random field on the fracture behavior of the model. Statistics of the peak load are presented as well as the size and shape of the fracture process zone at the moment when the maximum load is attained. Local averaging within the fracture process zone and weakest-link are identified as underlying mechanisms explaining the reported results. The companion paper, Part II [64], introduces an analytical model capable of predicting the distribution of the peak load obtained with the probabilistic discrete model via the simple estimation of extremes of a random field obtained as moving average of local strength.

cs.CE↗