The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.     

Covariance estimation under spatial dependence

Correlated multivariate processes have a dependence structure which must be taken into account when estimating the covariance matrix. The natural estimator of the covariance matrix is introduced and is shown that to be biased under the dependence structure. This bias is studied under two different asymptotic models, namely increasing the domain by increasing the number of observations, and increasing the number of observations in the fixed domain. Using the first asymptotic model, we quantify the convergence rate of the bias and of the covariance between the components of the estimated covariance matrix. The second asymptotic model serves to derive a fast and accurate bias correction. As shown, under mild hypotheses, the asymptotic normality of the estimated covariance matrix holds and can be used to test whether the bias is significant, for example, in the sense that the eigenvectors of the estimated and true covariance matrices are significantly different.     

Design of recursive least-squares fixed-lag smoother using covariance information in linear continuous stochastic systems

This paper newly designs the recursive least-squares (RLS) fixed-lag smoother and filter using the covariance information in linear continuous-time stochastic systems. It is assumed that the signal is observed with additive white observation noise and the signal is uncorrelated with the observation noise. The estimators require the covariance information of the signal and the variance of the observation noise. The auto-covariance function of the signal is expressed in the semi-degenerate kernel form.     

Approximate and efficient calculation of dominant Lyapunov exponents of high-dimensional nonlinear dynamic systems

This short communication presents an efficient method for calculating dominant Lyapunov exponents (LEs) of high-dimensional nonlinear dynamic systems based on their reduced-order models obtained from the linear model reduction theory. Mathematical derivation shows that the LEs of the reduced-order models correspond to the dominant LEs of the original systems. Two numerical examples are provided to demonstrate the effectiveness of the method.     

Code2vect: An efficient heterogenous data classifier and nonlinear regression technique

The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.     

关于ARMA序列协方差矩阵的逆

本文用矩阵方法导出ＡＲＭＡ（ｐ，ｑ）序列协方差阵的逆的一种表达式，由它可以较快计算平方和函数及其偏导数，还可以求得初值为零的条件平方和函数的误差。     

A statistical dynamics approach to the study of human health data: Resolving population scale diurnal variation in laboratory data

Statistical physics and information theory is applied to the clinical chemistry measurements present in a patient database containing 2.5 million patients' data over a 20-year period. Despite the seemingly naive approach of aggregating all patients over all times (with respect to particular clinical chemistry measurements), both a diurnal signal in the decay of the time-delayed mutual information and the presence of two sub-populations with differing health are detected. This provides a proof in principle that the highly fragmented data in electronic health records has potential for being useful in defining disease and human phenotypes.     

Stochastic processes with sample paths in reproducing kernel Hilbert spaces

A theorem of M. F. Driscoll says that, under certain restrictions, the probability that a given Gaussian process has its sample paths almost surely in a given reproducing kernel Hilbert space (RKHS) is either or . Driscoll also found a necessary and sufficient condition for that probability to be .

Doing away with Driscoll's restrictions, R. Fortet generalized his condition and named it nuclear dominance. He stated a theorem claiming nuclear dominance to be necessary and sufficient for the existence of a process (not necessarily Gaussian) having its sample paths in a given RKHS. This theorem - specifically the necessity of the condition - turns out to be incorrect, as we will show via counterexamples. On the other hand, a weaker sufficient condition is available.

Using Fortet's tools along with some new ones, we correct Fortet's theorem and then find the generalization of Driscoll's result. The key idea is that of a random element in a RKHS whose values are sample paths of a stochastic process. As in Fortet's work, we make almost no assumptions about the reproducing kernels we use, and we demonstrate the extent to which one may dispense with the Gaussian assumption.

     

Stochastic uniform observability of linear differential equations with multiplicative noise

The aim of this paper is to give a deterministic characterization of the uniform observability property of linear differential equations with multiplicative white noise in infinite dimensions. We also investigate the properties of a class of perturbed evolution operators and we used these properties to give a new representation of the covariance operators associated to the mild solutions of the investigated stochastic differential equations. The obtained results play an important role in obtaining necessary and sufficient conditions for the stochastic uniform observability property.