相关论文: Detecting sparse cone alternatives for Gaussian ra…

Given $p$-dimensional Gaussian vectors $X_i \stackrel{iid}{\sim} N(0, \Sigma)$, $1 \leq i \leq n$, where $p \geq n$, we are interested in testing a null hypothesis where $\Sigma = I_p$ against an alternative hypothesis where all eigenvalues…

Detection of sparse signals arises in a wide range of modern scientific studies. The focus so far has been mainly on Gaussian mixture models. In this paper, we consider the detection problem under a general sparse mixture model and obtain…

Let $\{f(t): t\in T\}$ be a smooth Gaussian random field over a parameter space $T$, where $T$ may be a subset of Euclidean space or, more generally, a Riemannian manifold. For any local maximum of $f(t)$ located at $t_0$ in the interior of…

The sparse inverse covariance estimation problem is commonly solved using an $\ell_{1}$-regularized Gaussian maximum likelihood estimator known as "graphical lasso", but its computational cost becomes prohibitive for large data sets. A…

The first passage time density of a diffusion process to a time varying threshold is of primary interest in different fields. Here we consider a Brownian motion in presence of an exponentially decaying threshold to model the neuronal…

The Rasch model has been widely used to analyse item response data in psychometrics and educational assessments. When the number of individuals and items are large, it may be impractical to provide all possible responses. It is desirable to…

This report introduces a new hierarchical Bayesian model for the EEG source localization problem. This model promotes structured sparsity to search for focal brain activity. This sparsity is obtained via a multivariate Bernoulli Laplacian…

A random Gaussian density field contains a fixed amount of Fisher information on the amplitude of its power spectrum. For a given smoothing scale, however, that information is not evenly distributed throughout the smoothed field. We…

Bayesian learning provides a unified skeleton to solve the electrophysiological source imaging task. From this perspective, existing source imaging algorithms utilize the Gaussian assumption for the observation noise to build the likelihood…

We consider the utilization of a computational model to guide the optimal acquisition of experimental data to inform the stochastic description of model input parameters. Our formulation is based on the recently developed consistent…

Mobility entropy is proposed to measure predictability of human movements, based on which, the upper and lower bound of prediction accuracy is deduced, but corresponding mathematical expressions of prediction accuracy keeps yet open. In…

The identification of new rare signals in data, the detection of a sudden change in a trend, and the selection of competing models, are among the most challenging problems in statistical practice. These challenges can be tackled using a…

We investigate the sparsity of Wiener polynomial chaos expansions of holomorphic maps $\mathcal{G}$ on Gaussian Hilbert spaces, as arise in the coefficient-to-solution maps of linear, second order, divergence-form elliptic PDEs with…

The purpose of this note is to prove a lower bound for the estimation of the memory parameter of a stationary long memory process. The memory parameter is defined here as the index of regular variation of the spectral density at 0. The…

We estimate the Hurst parameter $H$ of a fractional Brownian motion from discrete noisy data observed along a high frequency sampling scheme. The presence of systematic experimental noise makes recovery of $H$ more difficult since relevant…

We address the issue of finding an optimal detection method for a discontinuous or intermittent gravitational wave stochastic background. Such a signal might sound something like popcorn popping. We derive an appropriate version of the…

This article is motivated by studying multisensory effects on brain activities in intracranial electroencephalography (iEEG) experiments. Differential brain activities to multisensory stimulus presentations are zero in most regions and…

We consider the minimization of the number of non-zero coefficients (the $\ell_0$ "norm") of the representation of a data set in terms of a dictionary under a fidelity constraint. (Both the dictionary and the norm defining the constraint…

We consider here the identification of change-points on large-scale data streams. The objective is to find the most efficient way of combining information across data stream so that detection is possible under the smallest detectable change…

This paper studies the sparse identification problem of unknown sparse parameter vectors in stochastic dynamic systems. Firstly, a novel sparse identification algorithm is proposed, which can generate sparse estimates based on least squares…