Component-based regularisation of multivariate generalised linear mixed models

A Class of Infinitely Divisible Multivariate and Matrix Gamma Distributions and Cone-valued Generalised Gamma Convolutions

Classes of multivariate and cone valued infinitely divisible Gamma distributions are introduced. Particular emphasis is put on the cone-valued case, due to the relevance of infinitely divisible distributions on the positive semi-definite matrices in applications. The cone-valued class of generalised Gamma convolutions is studied. In particular, a characterisation in terms of an Itô-Wiener integral with respect to an infinitely divisible random measure associated to the jumps of a Lévy process is established. A new example of an infinitely divisible positive definite Gamma random matrix is intr…

Symmetric Rank Covariances: a Generalised Framework for Nonparametric Measures of Dependence

The need to test whether two random vectors are independent has spawned a large number of competing measures of dependence. We are interested in nonparametric measures that are invariant under strictly increasing transformations, such as Kendall's tau, Hoeffding's D, and the more recently discovered Bergsma--Dassios sign covariance. Each of these measures exhibits symmetries that are not readily apparent from their definitions. Making these symmetries explicit, we define a new class of multivariate nonparametric measures of dependence that we refer to as Symmetric Rank Covariances. This new cl…

Consistency and efficiency of Bayesian estimators in generalised linear inverse problems

Formulating a statistical inverse problem as one of inference in a Bayesian model has great appeal, notably for what this brings in terms of coherence, the interpretability of regularisation penalties, the integration of all uncertainties, and the principled way in which the set-up can be elaborated to encompass broader features of the context, such as measurement error, indirect observation, etc. The Bayesian formulation comes close to the way that most scientists intuitively regard the inferential task, and in principle allows the free use of subject knowledge in probabilistic model building…

Learning Clique Forests

We propose a topological learning algorithm for the estimation of the conditional dependency structure of large sets of random variables from sparse and noisy data. The algorithm, named Maximally Filtered Clique Forest (MFCF), produces a clique forest and an associated Markov Random Field (MRF) by generalising Prim's minimum spanning tree algorithm. To the best of our knowledge, the MFCF presents three elements of novelty with respect to existing structure learning approaches. The first is the repeated application of a local topological move, the clique expansion, that preserves the decomposab…

基于广义ANOVA分解的不完整数据高效估计

Efficient estimation with incomplete data via generalised ANOVA decompositions

针对含多组变量子集补充数据的非单调不完整数据场景，刻画线性泛函估计的渐近最小均方误差，提出基于迭代非参数回归和广义ANOVA分解的高效估计器，并扩展至采样偏差和非线性泛函场景。

A Statistically Identifiable Model for Tensor-Valued Gaussian Random Variables

Real-world signals typically span across multiple dimensions, that is, they naturally reside on multi-way data structures referred to as tensors. In contrast to standard ``flat-view'' multivariate matrix models which are agnostic to data structure and only describe linear pairwise relationships, we introduce the tensor-valued Gaussian distribution which caters for multilinear interactions -- the linear relationship between fibers -- which is reflected by the Kronecker separable structure of the mean and covariance. By virtue of the statistical identifiability of the proposed distribution formu…