Search Results

This paper proposes two sequential metamodel‐based methods for level‐set estimation (LSE) that leverage the uniform bound built on stochastic kriging: predictive variance reduction (PVR) and expected classification improvement (ECI). We show ...

For a fixed symmetric matrix $A$ and symmetric perturbation $E$ we develop purely deterministic bounds on how invariant subspaces of $A$ and $A+E$ can differ when measured by a suitable “rowwise” metric rather than via traditional measures of subspace ...

ABPA Ξ AΣ (ABRAXAS): Gnostic word of mystic meaning.

We present ABRA, a suite of algorithms to compute and maintain probabilistically guaranteed high-quality approximations of the betweenness centrality of all nodes (or edges) on both static and fully ...

We give a permutation approach to validation (estimation of out‐sample error). One typical use of validation is model selection. We establish the legitimacy of the proposed permutation complexity by proving a uniform bound on the out‐sample error, ...

We prove that a function definable with parameters in an o‐minimal structure is bounded away from ∞ as its argument goes to ∞ by a function definable without parameters, and that this new function can be chosen independently of the parameters in ...

Critically sampled multirate FIR filter banks exhibit periodically shift variant behavior caused by nonideal antialiasing filtering in the decimation stage. We assess their shift variance quantitatively by analysing changes in the output signal when the ...