Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
The thesis is a contribution to extreme-value statistics, more precisely to the estimation of clustering characteristics of extreme values. One summary measure of the tendency to form groups is the inverse average cluster size. In extreme-value context, th ...
We describe a set of probability distributions, dubbed compressible priors, whose independent and identically distributed (iid) realizations result in p-compressible signals. A signal x in R^N is called p-compressible with magnitude R if its sorted coeffic ...
In this paper, we investigate the construction of compromise estimators of location and scale, by averaging over several models selected among a specified large set of possible models. The weight given to each distribution is based on the profile likelihoo ...
We derive for the first time the limiting distribution of maxima of skew-t random vectors and we show that its limiting case, as the degree of freedom goes to infinity, is the skewed version of the well-known FlOsler-Reiss model. The advantage of the new f ...
Most researchers want evidence for the direction of an effect, not evidence against a point null hypothesis. Such evidence is ideally on a scale that is easily interpretable, with an accompanying standard error. Further, the evidence from identical experim ...
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve ...
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is either sampled from a Gaussian process (GP) or has low RKHS norm. We resolve ...
An alternative way to process data from polarization measurements for fuel cell model validation is proposed. The method is based on re- and subsampling of IV data, with which repetitive estimations are obtained for the model parameters. This way statistic ...
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance distortionless response (MVDR), multiple signal classification, and maximum likeli ...
Solute transport takes place in heterogeneous porous formations, with the log conductivity, Y = ln K, modeled as a stationary random space function of given univariate normal probability density function (pdf) with mean Y, variance σY2, and integral scale ...
